Lectures on the Combinatorial Structure of the Moduli Spaces of Riemann Surfaces
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Arxiv:1810.08742V1 [Math.CV] 20 Oct 2018 Centroid of the Points Zi and Ei = Zi − C
SOME REMARKS ON THE CORRESPONDENCE BETWEEN ELLIPTIC CURVES AND FOUR POINTS IN THE RIEMANN SPHERE JOSE´ JUAN-ZACAR´IAS Abstract. In this paper we relate some classical normal forms for complex elliptic curves in terms of 4-point sets in the Riemann sphere. Our main result is an alternative proof that every elliptic curve is isomorphic as a Riemann surface to one in the Hesse normal form. In this setting, we give an alternative proof of the equivalence betweeen the Edwards and the Jacobi normal forms. Also, we give a geometric construction of the cross ratios for 4-point sets in general position. Introduction A complex elliptic curve is by definition a compact Riemann surface of genus 1. By the uniformization theorem, every elliptic curve is conformally equivalent to an algebraic curve given by a cubic polynomial in the form 2 3 3 2 (1) E : y = 4x − g2x − g3; with ∆ = g2 − 27g3 6= 0; this is called the Weierstrass normal form. For computational or geometric pur- poses it may be necessary to find a Weierstrass normal form for an elliptic curve, which could have been given by another equation. At best, we could predict the right changes of variables in order to transform such equation into a Weierstrass normal form, but in general this is a difficult process. A different method to find the normal form (1) for a given elliptic curve, avoiding any change of variables, requires a degree 2 meromorphic function on the elliptic curve, which by a classical theorem always exists and in many cases it is not difficult to compute. -
13 Elliptic Function
13 Elliptic Function Recall that a function g : C → Cˆ is an elliptic function if it is meromorphic and there exists a lattice L = {mω1 + nω2 | m, n ∈ Z} such that g(z + ω)= g(z) for all z ∈ C and all ω ∈ L where ω1,ω2 are complex numbers that are R-linearly independent. We have shown that an elliptic function cannot be holomorphic, the number of its poles are finite and the sum of their residues is zero. Lemma 13.1 A non-constant elliptic function f always has the same number of zeros mod- ulo its associated lattice L as it does poles, counting multiplicites of zeros and orders of poles. Proof: Consider the function f ′/f, which is also an elliptic function with associated lattice L. We will evaluate the sum of the residues of this function in two different ways as above. Then this sum is zero, and by the argument principle from complex analysis 31, it is precisely the number of zeros of f counting multiplicities minus the number of poles of f counting orders. Corollary 13.2 A non-constant elliptic function f always takes on every value in Cˆ the same number of times modulo L, counting multiplicities. Proof: Given a complex value b, consider the function f −b. This function is also an elliptic function, and one with the same poles as f. By Theorem above, it therefore has the same number of zeros as f. Thus, f must take on the value b as many times as it does 0. -
Nonintersecting Brownian Motions on the Unit Circle: Noncritical Cases
The Annals of Probability 2016, Vol. 44, No. 2, 1134–1211 DOI: 10.1214/14-AOP998 c Institute of Mathematical Statistics, 2016 NONINTERSECTING BROWNIAN MOTIONS ON THE UNIT CIRCLE By Karl Liechty and Dong Wang1 DePaul University and National University of Singapore We consider an ensemble of n nonintersecting Brownian particles on the unit circle with diffusion parameter n−1/2, which are condi- tioned to begin at the same point and to return to that point after time T , but otherwise not to intersect. There is a critical value of T which separates the subcritical case, in which it is vanishingly un- likely that the particles wrap around the circle, and the supercritical case, in which particles may wrap around the circle. In this paper, we show that in the subcritical and critical cases the probability that the total winding number is zero is almost surely 1 as n , and →∞ in the supercritical case that the distribution of the total winding number converges to the discrete normal distribution. We also give a streamlined approach to identifying the Pearcey and tacnode pro- cesses in scaling limits. The formula of the tacnode correlation kernel is new and involves a solution to a Lax system for the Painlev´e II equation of size 2 2. The proofs are based on the determinantal × structure of the ensemble, asymptotic results for the related system of discrete Gaussian orthogonal polynomials, and a formulation of the correlation kernel in terms of a double contour integral. 1. Introduction. The probability models of nonintersecting Brownian motions have been studied extensively in last decade; see Tracy and Widom (2004, 2006), Adler and van Moerbeke (2005), Adler, Orantin and van Moer- beke (2010), Delvaux, Kuijlaars and Zhang (2011), Johansson (2013), Ferrari and Vet˝o(2012), Katori and Tanemura (2007) and Schehr et al. -
Examples from Complex Geometry
Examples from Complex Geometry Sam Auyeung November 22, 2019 1 Complex Analysis Example 1.1. Two Heuristic \Proofs" of the Fundamental Theorem of Algebra: Let p(z) be a polynomial of degree n > 0; we can even assume it is a monomial. We also know that the number of zeros is at most n. We show that there are exactly n. 1. Proof 1: Recall that polynomials are entire functions and that Liouville's Theorem says that a bounded entire function is in fact constant. Suppose that p has no roots. Then 1=p is an entire function and it is bounded. Thus, it is constant which means p is a constant polynomial and has degree 0. This contradicts the fact that p has positive degree. Thus, p must have a root α1. We can then factor out (z − α1) from p(z) = (z − α1)q(z) where q(z) is an (n − 1)-degree polynomial. We may repeat the above process until we have a full factorization of p. 2. Proof 2: On the real line, an algorithm for finding a root of a continuous function is to look for when the function changes signs. How do we generalize this to C? Instead of having two directions, we have a whole S1 worth of directions. If we use colors to depict direction and brightness to depict magnitude, we can plot a graph of a continuous function f : C ! C. Near a zero, we'll see all colors represented. If we travel in a loop around any point, we can keep track of whether it passes through all the colors; around a zero, we'll pass through all the colors, possibly many times. -
Riemann Surfaces
RIEMANN SURFACES AARON LANDESMAN CONTENTS 1. Introduction 2 2. Maps of Riemann Surfaces 4 2.1. Defining the maps 4 2.2. The multiplicity of a map 4 2.3. Ramification Loci of maps 6 2.4. Applications 6 3. Properness 9 3.1. Definition of properness 9 3.2. Basic properties of proper morphisms 9 3.3. Constancy of degree of a map 10 4. Examples of Proper Maps of Riemann Surfaces 13 5. Riemann-Hurwitz 15 5.1. Statement of Riemann-Hurwitz 15 5.2. Applications 15 6. Automorphisms of Riemann Surfaces of genus ≥ 2 18 6.1. Statement of the bound 18 6.2. Proving the bound 18 6.3. We rule out g(Y) > 1 20 6.4. We rule out g(Y) = 1 20 6.5. We rule out g(Y) = 0, n ≥ 5 20 6.6. We rule out g(Y) = 0, n = 4 20 6.7. We rule out g(C0) = 0, n = 3 20 6.8. 21 7. Automorphisms in low genus 0 and 1 22 7.1. Genus 0 22 7.2. Genus 1 22 7.3. Example in Genus 3 23 Appendix A. Proof of Riemann Hurwitz 25 Appendix B. Quotients of Riemann surfaces by automorphisms 29 References 31 1 2 AARON LANDESMAN 1. INTRODUCTION In this course, we’ll discuss the theory of Riemann surfaces. Rie- mann surfaces are a beautiful breeding ground for ideas from many areas of math. In this way they connect seemingly disjoint fields, and also allow one to use tools from different areas of math to study them. -
A Review on Elliptic Curve Cryptography for Embedded Systems
International Journal of Computer Science & Information Technology (IJCSIT), Vol 3, No 3, June 2011 A REVIEW ON ELLIPTIC CURVE CRYPTOGRAPHY FOR EMBEDDED SYSTEMS Rahat Afreen 1 and S.C. Mehrotra 2 1Tom Patrick Institute of Computer & I.T, Dr. Rafiq Zakaria Campus, Rauza Bagh, Aurangabad. (Maharashtra) INDIA [email protected] 2Department of C.S. & I.T., Dr. B.A.M. University, Aurangabad. (Maharashtra) INDIA [email protected] ABSTRACT Importance of Elliptic Curves in Cryptography was independently proposed by Neal Koblitz and Victor Miller in 1985.Since then, Elliptic curve cryptography or ECC has evolved as a vast field for public key cryptography (PKC) systems. In PKC system, we use separate keys to encode and decode the data. Since one of the keys is distributed publicly in PKC systems, the strength of security depends on large key size. The mathematical problems of prime factorization and discrete logarithm are previously used in PKC systems. ECC has proved to provide same level of security with relatively small key sizes. The research in the field of ECC is mostly focused on its implementation on application specific systems. Such systems have restricted resources like storage, processing speed and domain specific CPU architecture. KEYWORDS Elliptic curve cryptography Public Key Cryptography, embedded systems, Elliptic Curve Digital Signature Algorithm ( ECDSA), Elliptic Curve Diffie Hellman Key Exchange (ECDH) 1. INTRODUCTION The changing global scenario shows an elegant merging of computing and communication in such a way that computers with wired communication are being rapidly replaced to smaller handheld embedded computers using wireless communication in almost every field. This has increased data privacy and security requirements. -
Contents 5 Elliptic Curves in Cryptography
Cryptography (part 5): Elliptic Curves in Cryptography (by Evan Dummit, 2016, v. 1.00) Contents 5 Elliptic Curves in Cryptography 1 5.1 Elliptic Curves and the Addition Law . 1 5.1.1 Cubic Curves, Weierstrass Form, Singular and Nonsingular Curves . 1 5.1.2 The Addition Law . 3 5.1.3 Elliptic Curves Modulo p, Orders of Points . 7 5.2 Factorization with Elliptic Curves . 10 5.3 Elliptic Curve Cryptography . 14 5.3.1 Encoding Plaintexts on Elliptic Curves, Quadratic Residues . 14 5.3.2 Public-Key Encryption with Elliptic Curves . 17 5.3.3 Key Exchange and Digital Signatures with Elliptic Curves . 20 5 Elliptic Curves in Cryptography In this chapter, we will introduce elliptic curves and describe how they are used in cryptography. Elliptic curves have a long and interesting history and arise in a wide range of contexts in mathematics. The study of elliptic curves involves elements from most of the major disciplines of mathematics: algebra, geometry, analysis, number theory, topology, and even logic. Elliptic curves appear in the proofs of many deep results in mathematics: for example, they are a central ingredient in the proof of Fermat's Last Theorem, which states that there are no positive integer solutions to the equation xn + yn = zn for any integer n ≥ 3. Our goals are fairly modest in comparison, so we will begin by outlining the basic algebraic and geometric properties of elliptic curves and motivate the addition law. We will then study the behavior of elliptic curves modulo p: ultimately, there is a fairly strong analogy between the structure of the points on an elliptic curve modulo p and the integers modulo n. -
An Efficient Approach to Point-Counting on Elliptic Curves
mathematics Article An Efficient Approach to Point-Counting on Elliptic Curves from a Prominent Family over the Prime Field Fp Yuri Borissov * and Miroslav Markov Department of Mathematical Foundations of Informatics, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria; [email protected] * Correspondence: [email protected] Abstract: Here, we elaborate an approach for determining the number of points on elliptic curves 2 3 from the family Ep = fEa : y = x + a (mod p), a 6= 0g, where p is a prime number >3. The essence of this approach consists in combining the well-known Hasse bound with an explicit formula for the quantities of interest-reduced modulo p. It allows to advance an efficient technique to compute the 2 six cardinalities associated with the family Ep, for p ≡ 1 (mod 3), whose complexity is O˜ (log p), thus improving the best-known algorithmic solution with almost an order of magnitude. Keywords: elliptic curve over Fp; Hasse bound; high-order residue modulo prime 1. Introduction The elliptic curves over finite fields play an important role in modern cryptography. We refer to [1] for an introduction concerning their cryptographic significance (see, as well, Citation: Borissov, Y.; Markov, M. An the pioneering works of V. Miller and N. Koblitz from 1980’s [2,3]). Briefly speaking, the Efficient Approach to Point-Counting advantage of the so-called elliptic curve cryptography (ECC) over the non-ECC is that it on Elliptic Curves from a Prominent requires smaller keys to provide the same level of security. Family over the Prime Field Fp. -
ELLIPTIC FUNCTIONS (Approach of Abel and Jacobi)
Math 213a (Fall 2021) Yum-Tong Siu 1 ELLIPTIC FUNCTIONS (Approach of Abel and Jacobi) Significance of Elliptic Functions. Elliptic functions and their associated theta functions are a new class of special functions which play an impor- tant role in explicit solutions of real world problems. Elliptic functions as meromorphic functions on compact Riemann surfaces of genus 1 and their associated theta functions as holomorphic sections of holomorphic line bun- dles on compact Riemann surfaces pave the way for the development of the theory of Riemann surfaces and higher-dimensional abelian varieties. Two Approaches to Elliptic Function Theory. One approach (which we call the approach of Abel and Jacobi) follows the historic development with motivation from real-world problems and techniques developed for solving the difficulties encountered. One starts with the inverse of an elliptic func- tion defined by an indefinite integral whose integrand is the reciprocal of the square root of a quartic polynomial. An obstacle is to show that the inverse function of the indefinite integral is a global meromorphic function on C with two R-linearly independent primitive periods. The resulting dou- bly periodic meromorphic functions are known as Jacobian elliptic functions, though Abel was actually the first mathematician who succeeded in inverting such an indefinite integral. Nowadays, with the use of the notion of a Rie- mann surface, the inversion can be handled by using the fundamental group of the Riemann surface constructed to make the square root of the quartic polynomial single-valued. The great advantage of this approach is that there is vast literature for the properties of the Jacobain elliptic functions and of their associated Jacobian theta functions. -
Lecture 9 Riemann Surfaces, Elliptic Functions Laplace Equation
Lecture 9 Riemann surfaces, elliptic functions Laplace equation Consider a Riemannian metric gµν in two dimensions. In two dimensions it is always possible to choose coordinates (x,y) to diagonalize it as ds2 = Ω(x,y)(dx2 + dy2). We can then combine them into a complex combination z = x+iy to write this as ds2 =Ωdzdz¯. It is actually a K¨ahler metric since the condition ∂[i,gj]k¯ = 0 is trivial if i, j = 1. Thus, an orientable Riemannian manifold in two dimensions is always K¨ahler. In the diagonalized form of the metric, the Laplace operator is of the form, −1 ∆=4Ω ∂z∂¯z¯. Thus, any solution to the Laplace equation ∆φ = 0 can be expressed as a sum of a holomorphic and an anti-holomorphid function. ∆φ = 0 φ = f(z)+ f¯(¯z). → In the following, we assume Ω = 1 so that the metric is ds2 = dzdz¯. It is not difficult to generalize our results for non-constant Ω. Now, we would like to prove the following formula, 1 ∂¯ = πδ(z), z − where δ(z) = δ(x)δ(y). Since 1/z is holomorphic except at z = 0, the left-hand side should vanish except at z = 0. On the other hand, by the Stokes theorem, the integral of the left-hand side on a disk of radius r gives, 1 i dz dxdy ∂¯ = = π. Zx2+y2≤r2 z 2 I|z|=r z − This proves the formula. Thus, the Green function G(z, w) obeying ∆zG(z, w) = 4πδ(z w), − should behave as G(z, w)= log z w 2 = log(z w) log(¯z w¯), − | − | − − − − near z = w. -
Singularities of Integrable Systems and Nodal Curves
Singularities of integrable systems and nodal curves Anton Izosimov∗ Abstract The relation between integrable systems and algebraic geometry is known since the XIXth century. The modern approach is to represent an integrable system as a Lax equation with spectral parameter. In this approach, the integrals of the system turn out to be the coefficients of the characteristic polynomial χ of the Lax matrix, and the solutions are expressed in terms of theta functions related to the curve χ = 0. The aim of the present paper is to show that the possibility to write an integrable system in the Lax form, as well as the algebro-geometric technique related to this possibility, may also be applied to study qualitative features of the system, in particular its singularities. Introduction It is well known that the majority of finite dimensional integrable systems can be written in the form d L(λ) = [L(λ),A(λ)] (1) dt where L and A are matrices depending on the time t and additional parameter λ. The parameter λ is called a spectral parameter, and equation (1) is called a Lax equation with spectral parameter1. The possibility to write a system in the Lax form allows us to solve it explicitly by means of algebro-geometric technique. The algebro-geometric scheme of solving Lax equations can be briefly described as follows. Let us assume that the dependence on λ is polynomial. Then, with each matrix polynomial L, there is an associated algebraic curve C(L)= {(λ, µ) ∈ C2 | det(L(λ) − µE) = 0} (2) called the spectral curve. -
KLEIN's EVANSTON LECTURES. the Evanston Colloquium : Lectures on Mathematics, Deliv Ered from Aug
1894] KLEIN'S EVANSTON LECTURES, 119 KLEIN'S EVANSTON LECTURES. The Evanston Colloquium : Lectures on mathematics, deliv ered from Aug. 28 to Sept. 9,1893, before members of the Congress of Mai hematics held in connection with the World's Fair in Chicago, at Northwestern University, Evanston, 111., by FELIX KLEIN. Reported by Alexander Ziwet. New York, Macniillan, 1894. 8vo. x and 109 pp. THIS little volume occupies a somewhat unicrue position in mathematical literature. Even the Commission permanente would find it difficult to classify it and would have to attach a bewildering series of symbols to characterize its contents. It is stated as the object of these lectures " to pass in review some of the principal phases of the most recent development of mathematical thought in Germany" ; and surely, no one could be more competent to do this than Professor Felix Klein. His intimate personal connection with this develop ment is evidenced alike by the long array of his own works and papers, and by those of the numerous pupils and followers he has inspired. Eut perhaps even more than on this account is he fitted for this task by the well-known comprehensiveness of his knowledge and the breadth of view so -characteristic of all his work. In these lectures there is little strictly mathematical reason ing, but a great deal of information and expert comment on the most advanced work done in pure mathematics during the last twenty-five years. Happily this is given with such freshness and vigor of style as makes the reading a recreation.