computing equations of curves with many points
play

Computing Equations of Curves with Many Points Virgile Ducet 1 Claus - PowerPoint PPT Presentation

Computing Equations of Curves with Many Points Virgile Ducet 1 Claus Fieker 2 1 Institut de Mathmatiques de Luminy 2 Fachbereich Mathematik Universitt Kaiserslautern Algorithmic Number Theory Symposium, July 2012 Motivation Let C / F q be a


  1. Computing Equations of Curves with Many Points Virgile Ducet 1 Claus Fieker 2 1 Institut de Mathématiques de Luminy 2 Fachbereich Mathematik Universität Kaiserslautern Algorithmic Number Theory Symposium, July 2012

  2. Motivation Let C / F q be a curve. Set N ( C ) = | C ( F q ) | . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 2 / 16

  3. Motivation Let C / F q be a curve. Set N ( C ) = | C ( F q ) | . Question: How big can N ( C ) be? V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 2 / 16

  4. Motivation Let C / F q be a curve. Set N ( C ) = | C ( F q ) | . Question: How big can N ( C ) be? Introduce N q ( g ) = max N ( C ) . C / F q g ( C )= g V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 2 / 16

  5. Motivation Let C / F q be a curve. Set N ( C ) = | C ( F q ) | . Question: How big can N ( C ) be? Introduce N q ( g ) = max N ( C ) . C / F q g ( C )= g Upper bounds: ◮ Hasse-Weil-Serre bound: | N q ( g ) − q − 1 | � g · ⌊ 2 √ q ⌋ ; ◮ Oesterlé bound; ◮ articles of Howe and Lauter (’03, ’12),. . . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 2 / 16

  6. Lower bounds: Find curves with as many points as possible. V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 3 / 16

  7. Lower bounds: Find curves with as many points as possible. Possible methods: ◮ curves with explicit equations: Hermitian curves, Ree curves, Suzuki curves,. . . ◮ curves defined by explicit coverings: Artin-Schreier-Witt, Kummer,. . . ◮ curves with modular structure: elliptic or Drinfel’d modular curves,. . . ◮ curves defined by a non-explicit covering: abelian coverings (Class Field Theory, Drinfel’d modules),. . . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 3 / 16

  8. Lower bounds: Find curves with as many points as possible. Possible methods: ◮ curves with explicit equations: Hermitian curves, Ree curves, Suzuki curves,. . . ◮ curves defined by explicit coverings: Artin-Schreier-Witt, Kummer,. . . ◮ curves with modular structure: elliptic or Drinfel’d modular curves,. . . ◮ curves defined by a non-explicit covering: abelian coverings (Class Field Theory, Drinfel’d modules),. . . Our approach: Class Field Theory. Therefore we switch between the language of function fields and curves. For instance, if K = F q ( C ) , we set N ( K ) def = # Pl ( K , 1 ) = N ( C ) . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 3 / 16

  9. Why use Class Field Theory? Remark: Let L / K be an algebraic extension of algebraic function fields defined over F q . Then N ( L ) � [ L : K ]# Split F q ( L / K ) + # TotRam F q ( L / K ) . Class Field Theory describes the abelian extensions of K in terms of data intrinsic to K and provides a good control on the ramification and decomposition behavior in the extension. V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 4 / 16

  10. Why use Class Field Theory? Remark: Let L / K be an algebraic extension of algebraic function fields defined over F q . Then N ( L ) � [ L : K ]# Split F q ( L / K ) + # TotRam F q ( L / K ) . Class Field Theory describes the abelian extensions of K in terms of data intrinsic to K and provides a good control on the ramification and decomposition behavior in the extension. Problem: One does not know in general the equations of the abelian coverings of K (problematic for applications, for example to coding theory). V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 4 / 16

  11. Why use Class Field Theory? Remark: Let L / K be an algebraic extension of algebraic function fields defined over F q . Then N ( L ) � [ L : K ]# Split F q ( L / K ) + # TotRam F q ( L / K ) . Class Field Theory describes the abelian extensions of K in terms of data intrinsic to K and provides a good control on the ramification and decomposition behavior in the extension. Problem: One does not know in general the equations of the abelian coverings of K (problematic for applications, for example to coding theory). This Talk: we explain how to find these equations and describe an algorithm to find good curves (look at www.manypoints.org). V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 4 / 16

  12. The Artin Map Let L / K be an abelian extension. Let P be a place of K and Q be a place of L over P . Let F P (resp. F Q ) be the residue field of K at P (resp. of L at Q ). When P is unramified the reduction map Gal P ( L / K ) → Gal ( F Q / F P ) is an isomorphism. The pre-image of Frobenius is independent of Q ; one denotes it by ( P , L / K ) and call it the Frobenius automorphism at P. Definition: The map P �→ ( P , L / K ) ∈ Gal ( L / K ) can be extended linearly to the set of divisors supported outside the ramified places of L / K. The resulting map is called the Artin map and is denoted ( · , L / K ) . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 5 / 16

  13. Class Field Theory Definition: A modulus on K is an effective divisor. Let m be a modulus supported on a set S ⊂ Pl K , we denote by Div m the group of divisors which support is disjoint from S. Set P m , 1 = { div ( f ) : f ∈ K × and v P ( f − 1 ) ≥ v P ( m ) for all P ∈ S } . Definition: A congruence subgroup modulo m is a subgroup H < Div m of finite index such that P m , 1 ⊆ H. Existence Theorem: For every modulus m and every congruence subgroup H modulo m , there exists a unique abelian extension L H of K, called the class field of H, such that the Artin map provides an isomorphism Div m / H ∼ = Gal ( L H / K ) . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 6 / 16

  14. Artin Reciprocity Law: For every abelian extension L / K , there exists an admissible modulus m and a unique congruence subgroup H L , m modulo m , such that the Artin map provides an isomorphism Div m / H L , m ∼ = Gal ( L / K ) . Definition: The conductor of L / K, denoted f L / K , is the smallest admissible modulus. It is supported on exactly the ramified places of L / K. Main Theorem of Class Field Theory: Let m be a modulus. There is a 1-1 inclusion reversing correspondence between congruence subgroups H modulo m and finite abelian extensions L of K of conductor smaller than m . Furthermore the Artin map provides an isomorphism Div m / H ∼ = Gal ( L / K ) . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 7 / 16

  15. Computing Abelian Extensions Data: Let m be a modulus over K and H be a congruence subgroup modulo m . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 8 / 16

  16. Computing Abelian Extensions Data: Let m be a modulus over K and H be a congruence subgroup modulo m . Goal: Compute the class field L of H . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 8 / 16

  17. Computing Abelian Extensions Data: Let m be a modulus over K and H be a congruence subgroup modulo m . Goal: Compute the class field L of H . Assumption: Div m / H ∼ = Z /ℓ m Z for a prime number ℓ and an integer m � 1. Two cases: ℓ = p def = char ( K ) or ℓ � = p . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 8 / 16

  18. Computing Abelian Extensions Data: Let m be a modulus over K and H be a congruence subgroup modulo m . Goal: Compute the class field L of H . Assumption: Div m / H ∼ = Z /ℓ m Z for a prime number ℓ and an integer m � 1. Two cases: ℓ = p def = char ( K ) or ℓ � = p . Strategy: Find an abelian extension M of K containing L for which we can compute explicitly the Artin map. Then compute L as the subfield of M fixed by the image of H . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 8 / 16

  19. � � � M L Div m / H K Remark: Let P ∈ Pl K . Then ( P , M / K ) | L = ( P , L / K ) . So ( H , M / K ) = { ( P , M / K ) : P ∈ H } = { σ ∈ Gal ( M / K ) : σ | L = Id L } = Gal ( M / L ) . Galois Theory implies L = M ( H , M / K ) . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 9 / 16

  20. Set n = l m . The two cases are related to the following equations: y n = α � if ℓ � = p (Kummer theory) ℘ ( � y ) = � α if l = p (Artin-Schreier-Witt theory) . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 10 / 16

  21. Set n = l m . The two cases are related to the following equations: y n = α � if ℓ � = p (Kummer theory) ℘ ( � y ) = � α if l = p (Artin-Schreier-Witt theory) . Case ℓ � = p : Set K ′ = K ( ζ n ) and L ′ = L ( ζ n ) . By Kummer theory one can compute a √ α ) for a S -unit α . Adding the set S of places of K ′ such that L ′ = K ′ ( n n th roots of every S -unit to K ′ , we obtain an abelian extension √ U S ) for which we have an explicit Artin map. Using the data of M = K ′ ( n the congruence subgroup H , one can compute L ′ . V. Ducet and C. Fieker (IML, FMUK) Computing Equations of Curves ANTS X 10 / 16

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend