spinor regular ternary quadratic lattices
play

Spinor regular ternary quadratic lattices Anna Haensch Duquesne 1 - PowerPoint PPT Presentation

Spinor regular ternary quadratic lattices Anna Haensch Duquesne 1 University Joint work with Andy Earnest Computational Challenges in the Theory of Lattices ICERM 27 April 2018 1 doo-KANE 1 / 39 A rational polynomial f ( x 1 , ..., x n )


  1. Spinor regular ternary quadratic lattices Anna Haensch Duquesne 1 University Joint work with Andy Earnest Computational Challenges in the Theory of Lattices ICERM 27 April 2018 1 doo-KANE 1 / 39

  2. A rational polynomial f ( x 1 , ..., x n ) represents an integer a if f ( x 1 , ..., x n ) = a has a solution with x 1 , ..., x n integers. 2 / 39

  3. A rational polynomial f ( x 1 , ..., x n ) represents an integer a if f ( x 1 , ..., x n ) = a has a solution with x 1 , ..., x n integers. The Representation Problem Can we determine the set of all integers represented by f ? 2 / 39

  4. Hilbert’s 10th Problem, 1900 To devise a process according to which it can be determined in a finite number of operations whether a given Diophantine equation is solvable in rational integers. 3 / 39

  5. Hilbert’s 10th Problem, 1900 To devise a process according to which it can be determined in a finite number of operations whether a given Diophantine equation is solvable in rational integers. Matiyasevich (1970) → no general solution exists. 3 / 39

  6. Theorem (Siegel, 1972) For f quadratic, there exists a number C depending on a and f , such that if f ( x 1 , ..., x n ) = a has an integer solution, then it must have one with i ≤ i ≤ a | x i |≤ C . max 4 / 39

  7. Theorem (Siegel, 1972) For f quadratic, there exists a number C depending on a and f , such that if f ( x 1 , ..., x n ) = a has an integer solution, then it must have one with i ≤ i ≤ a | x i |≤ C . max tl;dr → it’s possible, but totally impractical. 4 / 39

  8. Theorem (Hasse, 1920) For f quadratic, the equation f ( x 1 , ..., x n ) = a has a rational solution if and only if has a solution over Q p for every prime p, and over R . 5 / 39

  9. Theorem (Hasse, 1920) For f quadratic, the equation f ( x 1 , ..., x n ) = a has a rational solution if and only if has a solution over Q p for every prime p, and over R . → Local-Global Principle 5 / 39

  10. Example 1: Let f be the quadratic equation f ( x , y ) = x 2 + 11 y 2 . 6 / 39

  11. Example 1: Let f be the quadratic equation f ( x , y ) = x 2 + 11 y 2 . Then � 2 � 2 � 1 � 1 = 12 + 11 4 = 3 2 2 6 / 39

  12. Example 1: Let f be the quadratic equation f ( x , y ) = x 2 + 11 y 2 . Then � 2 � 2 � 1 � 1 = 12 + 11 4 = 3 2 2 and � 2 � 2 � 4 � 1 = 27 + 11 9 = 3 3 3 6 / 39

  13. Example 1: Let f be the quadratic equation f ( x , y ) = x 2 + 11 y 2 . Then � 2 � 2 � 1 � 1 = 12 + 11 4 = 3 2 2 and � 2 � 2 � 4 � 1 = 27 + 11 9 = 3 3 3 but clearly f ( x , y ) = 3 has no integral solution. 6 / 39

  14. The Big Question: To what extent does an integral local-global principle hold? When does it fail? And why? And how badly? 7 / 39

  15. The General Setup A quadratic polynomial f ( � x ) can be written as f ( � x ) = q ( � x ) + ℓ ( � x ) + c where ◮ q is a homogeneous quadratic. ◮ ℓ is a homogeneous linear. ◮ c is a constant. 8 / 39

  16. The General Setup A quadratic polynomial f ( � x ) can be written as f ( � x ) = q ( � x ) + ℓ ( � x ) where ◮ q is a homogeneous quadratic. ◮ ℓ is a homogeneous linear. ◮ c is a constant. 8 / 39

  17. The Homogeneous Case 9 / 39

  18. The Homogeneous Case For f ( � x ) = q ( � x ) homogeneous (positive definite), define L = ( Z n , q ) . Then L is a quadratic lattice , and q ( L ) = { a ∈ N : f ( x 1 , ..., x n ) = a has a solution in Z n } . 9 / 39

  19. The Homogeneous Case For f ( � x ) = q ( � x ) homogeneous (positive definite), define L = ( Z n , q ) . Then L is a quadratic lattice , and q ( L ) = { a ∈ N : f ( x 1 , ..., x n ) = a has a solution in Z n } . For p prime, define the local lattice as L p = L ⊗ Z Z p and q ( L p ) accordingly. 9 / 39

  20. For a quadratic lattice L = ( Z n , q ) and V = Q L , ◮ the class of L is given by cls( L ) = O ( V ) · L , 10 / 39

  21. For a quadratic lattice L = ( Z n , q ) and V = Q L , ◮ the class of L is given by cls( L ) = O ( V ) · L , ◮ the spinor genus of L is given by spn( L ) = O + ( V ) O ′ A ( L ) · L , where O ′ ( V p ) is the kernel of the spinor norm map, θ , 10 / 39

  22. For a quadratic lattice L = ( Z n , q ) and V = Q L , ◮ the class of L is given by cls( L ) = O ( V ) · L , ◮ the spinor genus of L is given by spn( L ) = O + ( V ) O ′ A ( L ) · L , where O ′ ( V p ) is the kernel of the spinor norm map, θ , ◮ the genus of L is given by gen( L ) = O A ( V ) · L . 10 / 39

  23. For a quadratic lattice L = ( Z n , q ) and V = Q L , ◮ the class of L is given by cls( L ) = O ( V ) · L = { M ⊆ V : M ∼ = L } , ◮ the spinor genus of L is given by spn( L ) = O + ( V ) O ′ A ( L ) · L , where O ′ ( V p ) is the kernel of the spinor norm map, θ , ◮ the genus of L is given by gen( L ) = O A ( V ) · L = { M ⊆ V : M p ∼ = L p for all p } . 10 / 39

  24. Similarly to q ( L ), define ◮ q (spn( L ))= the set of integers represented by M ∈ spn( L ). ◮ q (gen( L ))= the set of integers represented by M ∈ gen( L ). 11 / 39

  25. Similarly to q ( L ), define ◮ q (spn( L ))= the set of integers represented by M ∈ spn( L ). ◮ q (gen( L ))= the set of integers represented by M ∈ gen( L ). A nice integral local global principle would look like “ a ∈ q (gen( L )) ⇐ ⇒ a ∈ q ( L )” 11 / 39

  26. Similarly to q ( L ), define ◮ q (spn( L ))= the set of integers represented by M ∈ spn( L ). ◮ q (gen( L ))= the set of integers represented by M ∈ gen( L ). A nice integral local global principle would look like “ a ∈ q (gen( L )) ⇐ ⇒ a ∈ q ( L )” ...but that would be incorrect (recall example 1). 11 / 39

  27. Example 2: Let L be the lattice with quadratic map q ( x , y , z ) = x 2 + y 2 + z 2 12 / 39

  28. Example 2: Let L be the lattice with quadratic map q ( x , y , z ) = x 2 + y 2 + z 2 then q ( L ) = { n ∈ N : n � = 4 a (8 b + 7) for a , b ∈ Z } . 12 / 39

  29. Example 2: Let L be the lattice with quadratic map q ( x , y , z ) = x 2 + y 2 + z 2 then q ( L ) = { n ∈ N : n � = 4 a (8 b + 7) for a , b ∈ Z } . Here, gen( L ) = spn( L ) = cls ( L ) so clearly q (gen( L )) = q ( L ) . 12 / 39

  30. The Big Question: Under what conditions does q (gen( L )) = q ( L ) hold? 13 / 39

  31. The Big Question: Under what conditions does q (gen( L )) = q ( L ) hold? And if it fails, why, and where, and how badly? 13 / 39

  32. The Big Question: Under what conditions does q (spn( L )) = q ( L ) hold? And if it fails, why, and where, and how badly? 13 / 39

  33. Theorem (Kloosterman, 1926, Tartakowsky, 1929) For positive definite L with rk ( L ) ≥ 4 then a ∈ gen( L ) ⇐ ⇒ a ∈ q ( L ) provided that a ≫ 0 (and p s ∤ a for p anisotropic when n = 4 ). 14 / 39

  34. Theorem (Kloosterman, 1926, Tartakowsky, 1929) For positive definite L with rk ( L ) ≥ 4 then a ∈ gen( L ) ⇐ ⇒ a ∈ q ( L ) provided that a ≫ 0 (and p s ∤ a for p anisotropic when n = 4 ). ◮ Hsia, Kneser Kitaoka (1977): Gave computable constant a ∈ gen( L ) ⇐ ⇒ a ∈ q ( L ) if a ≫ C . 14 / 39

  35. Theorem (Kloosterman, 1926, Tartakowsky, 1929) For positive definite L with rk ( L ) ≥ 4 then a ∈ gen( L ) ⇐ ⇒ a ∈ q ( L ) provided that a ≫ 0 (and p s ∤ a for p anisotropic when n = 4 ). ◮ Hsia, Kneser Kitaoka (1977): Gave computable constant a ∈ gen( L ) ⇐ ⇒ a ∈ q ( L ) if a ≫ C . ◮ Icaza (1999): Made C effective. 14 / 39

  36. Theorem (Duke, Schulze-Pillot, 1990) For positive definite L with rk ( L ) = 3 , a ∈ ∗ q (spn( L )) ⇐ ⇒ a ∈ q ( L ) provided that a ≫ 0 . 15 / 39

  37. What might the genus look like? 16 / 39

  38. What might the genus look like? Class Number One Spinor-Class Number One Single Spinor Genus Worst Case Scenario 16 / 39

  39. Theorem (Earnest, Hsia, 1991) For a positive-definite lattice L with rank n ≥ 5 , gen( L ) = cls ( L ) ⇐ ⇒ spn( L ) = cls ( L ) 17 / 39

  40. Theorem (Earnest, Hsia, 1991) For a positive-definite lattice L with rank n ≥ 5 , gen( L ) = cls ( L ) ⇐ ⇒ spn( L ) = cls ( L ) Class Number One Spinor-Class Number One 17 / 39

  41. Goal 1: 18 / 39

  42. Goal 1: To classify all lattices which are regular , that is q (gen( L )) = q ( L ) , 18 / 39

  43. Goal 1: To classify all lattices which are regular , that is q (gen( L )) = q ( L ) , and spinor regular , that is, q (spn( L )) = q ( L ) . 18 / 39

  44. When rk ( L ) ≥ 4, there are infinitely many regular forms. 19 / 39

  45. Theorem (Jagy, Kaplansky, Schiemann, 1997) There are at most 913 regular ternary lattices, that is, lattices for which q (gen( L )) = q ( L ) . 20 / 39

  46. Theorem (Jagy, Kaplansky, Schiemann, 1997) There are at most 913 regular ternary lattices, that is, lattices for which q (gen( L )) = q ( L ) . ◮ Jagy, Kaplansky, Schiemann, 1997: Confirmed 891 of them to be regular. 20 / 39

  47. Theorem (Jagy, Kaplansky, Schiemann, 1997) There are at most 913 regular ternary lattices, that is, lattices for which q (gen( L )) = q ( L ) . ◮ Jagy, Kaplansky, Schiemann, 1997: Confirmed 891 of them to be regular. ◮ Oh, 2011: Confirmed 8 more on the list. 20 / 39

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