configurations of extremal type ii lattices and codes
play

Configurations of Extremal Type II Lattices and Codes Scott Duke - PowerPoint PPT Presentation

Nov 22, 2022 •472 likes •1.65k views

Configurations of Extremal Type II Lattices and Codes Scott Duke Kominers Department of Economics, Harvard University, and Harvard Business School AMS-MAA-SIAM Session on Research in Mathematics by Undergraduates Joint Mathematics Meetings

  1. Configurations of Extremal Type II Lattices Introduction Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n, then the minimal-norm vectors of L generate L. Folklore: n ∈ { 8 , 24 } Venkov (1984): n ∈ { 32 } Ozeki (1986): n ∈ { 32 , 48 } Scott Duke Kominers (Harvard) January 15, 2010 4

  2. Configurations of Extremal Type II Lattices Introduction Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n, then the minimal-norm vectors of L generate L. Folklore: n ∈ { 8 , 24 } Venkov (1984): n ∈ { 32 } Ozeki (1986): n ∈ { 32 , 48 } K. (2009): n ∈ { 56 , 72 , 96 } Scott Duke Kominers (Harvard) January 15, 2010 4

  3. Configurations of Extremal Type II Lattices Introduction Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n, then the minimal-norm vectors of L generate L. Folklore: n ∈ { 8 , 24 } Venkov (1984): n ∈ { 32 } Ozeki (1986): n ∈ { 32 , 48 } K. (2009): n ∈ { 56 , 72 , 96 } Elkies (2010): n ∈ { 120 } Scott Duke Kominers (Harvard) January 15, 2010 4

  4. Configurations of Extremal Type II Lattices Methods Theta Functions Scott Duke Kominers (Harvard) January 15, 2010 5

  5. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function of a lattice L encodes the lengths of L ’s vectors.” Scott Duke Kominers (Harvard) January 15, 2010 5

  6. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function of a lattice L encodes the lengths of L ’s vectors.” How: “norm � x , x � ” ⇐ ⇒ “length” Scott Duke Kominers (Harvard) January 15, 2010 5

  7. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function of a lattice L encodes the lengths of L ’s vectors.” How: “norm � x , x � ” ⇐ ⇒ “length” What: ∞ � � e i πτ � x , x � = a k e i πτ ( k ) Θ L ( τ ) = x ∈ L k =1 Scott Duke Kominers (Harvard) January 15, 2010 5

  8. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Scott Duke Kominers (Harvard) January 15, 2010 6

  9. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Example: Scott Duke Kominers (Harvard) January 15, 2010 6

  10. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Example: Scott Duke Kominers (Harvard) January 15, 2010 6

  11. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Example: � e i πτ � x , x � Θ Z 2 ( τ ) = x ∈ Z 2 Scott Duke Kominers (Harvard) January 15, 2010 6

  12. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Example: � e i πτ � x , x � Θ Z 2 ( τ ) = x ∈ Z 2 =1 + 4 e i πτ + 4 e 2 i πτ Scott Duke Kominers (Harvard) January 15, 2010 6

  13. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Example: � e i πτ � x , x � Θ Z 2 ( τ ) = x ∈ Z 2 =1 + 4 e i πτ + 4 e 2 i πτ + 0 e 3 i πτ + 4 e 4 i πτ Scott Duke Kominers (Harvard) January 15, 2010 6

  14. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Example: � e i πτ � x , x � Θ Z 2 ( τ ) = x ∈ Z 2 =1 + 4 e i πτ + 4 e 2 i πτ + 0 e 3 i πτ + 4 e 4 i πτ + 8 e 4 i πτ + · · · Scott Duke Kominers (Harvard) January 15, 2010 6

  15. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Scott Duke Kominers (Harvard) January 15, 2010 7

  16. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Why we care: For L Type II of rank n , the theta function Θ L is a modular form : Θ L ∈ M n / 2 . Scott Duke Kominers (Harvard) January 15, 2010 7

  17. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Why we care: For L Type II of rank n , the theta function Θ L is a modular form : Θ L ∈ M n / 2 . For n small, the space M n / 2 is small. Scott Duke Kominers (Harvard) January 15, 2010 7

  18. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Why we care: For L Type II of rank n , the theta function Θ L is a modular form : Θ L ∈ M n / 2 . For n (relatively) small, the space M n / 2 is (very) small. Scott Duke Kominers (Harvard) January 15, 2010 7

  19. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Why we care: For L Type II of rank n , the theta function Θ L is a modular form : Θ L ∈ M n / 2 . For n (relatively) small, the space M n / 2 is (very) small. Scott Duke Kominers (Harvard) January 15, 2010 7

  20. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L encodes the lengths of L ’s vectors.” Why we care: For L Type II of rank n , the theta function Θ L is a modular form : Θ L ∈ M n / 2 . For n (relatively) small, the space M n / 2 is (very) small. We can therefore study the function Θ L even if we cannot write down a basis for L . Scott Duke Kominers (Harvard) January 15, 2010 7

  21. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L is a modular form which encodes the lengths of L ’s vectors.” Scott Duke Kominers (Harvard) January 15, 2010 8

  22. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L is a modular form which encodes the lengths of L ’s vectors.” What we do: Scott Duke Kominers (Harvard) January 15, 2010 8

  23. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L is a modular form which encodes the lengths of L ’s vectors.” What we do: We study weighted theta functions � x ∈ L P ( x ) e i πτ � x , x � which encode norms and distributions of lattice vectors. Scott Duke Kominers (Harvard) January 15, 2010 8

  24. Configurations of Extremal Type II Lattices Methods Theta Functions Slogan: “The theta function � x ∈ L e i πτ � x , x � of a lattice L is a modular form which encodes the lengths of L ’s vectors.” What we do: We study weighted theta functions � x ∈ L P ( x ) e i πτ � x , x � which encode norms and distributions of lattice vectors. We obtain a “system of equations in vector distributions” which proves our configuration results. Scott Duke Kominers (Harvard) January 15, 2010 8

  25. Configurations of Extremal Type II Lattices Results Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n, then the minimal-norm vectors of L generate L. Folklore: n ∈ { 8 , 24 } Venkov (1984): n ∈ { 32 } Ozeki (1986): n ∈ { 32 , 48 } K. (2009): n ∈ { 56 , 72 , 96 } Elkies (2010): n ∈ { 120 } Scott Duke Kominers (Harvard) January 15, 2010 9

  26. Configurations of Extremal Type II Lattices Results Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n, then the minimal-norm vectors of L generate L. Folklore: n ∈ { 8 , 24 } Venkov (1984): n ∈ { 32 } Ozeki (1986): n ∈ { 32 , 48 } K. (2009): n ∈ { 56 , 72 , 96 } Elkies (2010): n ∈ { 120 } Scott Duke Kominers (Harvard) January 15, 2010 9

  27. Configurations of Extremal Type II Lattices Results Lattice Configuration Results Scott Duke Kominers (Harvard) January 15, 2010 10

  28. Configurations of Extremal Type II Lattices Results Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n with minimal norm m ( L ) , then L is generated by its vectors of norms m ( L ) and ( m ( L ) + 2) . Scott Duke Kominers (Harvard) January 15, 2010 10

  29. Configurations of Extremal Type II Lattices Results Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n with minimal norm m ( L ) , then L is generated by its vectors of norms m ( L ) and ( m ( L ) + 2) . Folklore: n ∈ { 16 } Scott Duke Kominers (Harvard) January 15, 2010 10

  30. Configurations of Extremal Type II Lattices Results Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n with minimal norm m ( L ) , then L is generated by its vectors of norms m ( L ) and ( m ( L ) + 2) . Folklore: n ∈ { 16 } Ozeki (1989): n ∈ { 40 } Scott Duke Kominers (Harvard) January 15, 2010 10

  31. Configurations of Extremal Type II Lattices Results Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n with minimal norm m ( L ) , then L is generated by its vectors of norms m ( L ) and ( m ( L ) + 2) . Folklore: n ∈ { 16 } Ozeki (1989): n ∈ { 40 } Abel–K. (2008): n ∈ { 40 , 80 , 120 } (unified method) Scott Duke Kominers (Harvard) January 15, 2010 10

  32. Configurations of Extremal Type II Lattices Results Lattice Configuration Results Theorem Template If L is Type II and extremal of rank n with minimal norm m ( L ) , then L is generated by its vectors of norms m ( L ) and ( m ( L ) + 2) . Folklore: n ∈ { 16 } Ozeki (1989): n ∈ { 40 } Abel–K. (2008): n ∈ { 40 , 80 , 120 } (unified method) Elkies–K. (2010): Norm-( m ( L ) + 2) suffices for n ∈ { 40 , 80 } Scott Duke Kominers (Harvard) January 15, 2010 10

  33. Configurations of Extremal Type II Lattices Pause Scott Duke Kominers (Harvard) January 15, 2010 11

  34. Configurations of Extremal Type II Lattices Pause We just described configurations of lattices. Scott Duke Kominers (Harvard) January 15, 2010 11

  35. Configurations of Extremal Type II Lattices Pause We just described configurations of lattices. Recall the title slide.... Scott Duke Kominers (Harvard) January 15, 2010 11

  36. Configurations of Extremal Type II Lattices Pause Configurations of Extremal Type II Lattices and Codes Scott Duke Kominers Department of Economics, Harvard University, and Harvard Business School AMS-MAA-SIAM Session on Research in Mathematics by Undergraduates Joint Mathematics Meetings January 15, 2010 Scott Duke Kominers (Harvard) January 15, 2010 11

  37. Configurations of Extremal Type II Lattices Pause We just described configurations of lattices. Recall the title slide.... Scott Duke Kominers (Harvard) January 15, 2010 11

  38. Configurations of Extremal Type II Lattices Pause We just described configurations of lattices. Recall the title slide.... Natural Question Scott Duke Kominers (Harvard) January 15, 2010 11

  39. Configurations of Extremal Type II Lattices Pause We just described configurations of lattices. Recall the title slide.... Natural Question What about codes? Scott Duke Kominers (Harvard) January 15, 2010 11

  40. Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  41. Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II extremal doubly-even self-dual code � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  42. Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II lattice of rank n ∼ “integer vector space” of rank n code of length n ∼ linear subspace of F n 2 extremal doubly-even self-dual code � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  43. Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II unimodular ∼ self-dual self-dual ∼ self-dual extremal doubly-even self-dual code � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  44. Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II even ∼ all vectors have even norm doubly-even ∼ 4 divides all codewords’ weights extremal doubly-even self-dual code � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  45. Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II extremal doubly-even self-dual code � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  46. Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II extremal ∼ shortest vector is as long as possible extremal ∼ smallest codeword is as large as possible extremal doubly-even self-dual code � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  47. Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II extremal doubly-even self-dual code � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  48. � Configurations of Extremal Type II Codes Introduction Key Concepts extremal even unimodular lattice � �� � Type II Construction A extremal doubly-even self-dual code � �� � Type II Scott Duke Kominers (Harvard) January 15, 2010 12

  49. Configurations of Extremal Type II Codes Methods Weight Enumerators Theta Function Slogan: “The theta function Θ L ( τ ) of a lattice L encodes the lengths of L ’s vectors.” Scott Duke Kominers (Harvard) January 15, 2010 13

  50. Configurations of Extremal Type II Codes Methods Weight Enumerators Theta Function Slogan: “The theta function Θ L ( τ ) of a lattice L encodes the lengths of L ’s vectors.” Weight Enumerator Slogan: “The weight enumerator W C ( x , y ) of a code C encodes the weights of C ’s codewords.” Scott Duke Kominers (Harvard) January 15, 2010 13

  51. Configurations of Extremal Type II Codes Methods Weight Enumerators Theta Function Slogan: “The theta function Θ L ( τ ) of a lattice L is a modular form which encodes the lengths of L ’s vectors.” Weight Enumerator Slogan: “The weight enumerator W C ( x , y ) of a code C encodes the weights of C ’s codewords.” Scott Duke Kominers (Harvard) January 15, 2010 13

  52. Configurations of Extremal Type II Codes Methods Weight Enumerators Theta Function Slogan: “The theta function Θ L ( τ ) of a lattice L is a modular form which encodes the lengths of L ’s vectors.” Weight Enumerator Slogan: “The weight enumerator W C ( x , y ) of a code C encodes the weights of C ’s codewords.” Scott Duke Kominers (Harvard) January 15, 2010 13

  53. Configurations of Extremal Type II Codes Methods Weight Enumerators Theta Function Slogan: “The theta function Θ L ( τ ) of a lattice L is a modular form which encodes the lengths of L ’s vectors.” Weight Enumerator Slogan: “The weight enumerator W C ( x , y ) of a code C is a classifiable polynomial which encodes the weights of C ’s codewords.” Scott Duke Kominers (Harvard) January 15, 2010 13

  54. Configurations of Extremal Type II Codes Methods Weight Enumerators Theta Function Slogan: “The theta function Θ L ( τ ) of a lattice L is a modular form which encodes the lengths of L ’s vectors.” Weight Enumerator Slogan: “The weight enumerator W C ( x , y ) of a code C is a classifiable polynomial which encodes the weights of C ’s codewords.” Scott Duke Kominers (Harvard) January 15, 2010 13

  55. Configurations of Extremal Type II Codes Methods Weight Enumerators Theta Function Slogan: “The weighted theta function Θ L , P ( τ ) of L is a modular form which encodes the distributions of L ’s vectors.” Weight Enumerator Slogan: “The harmonic weight enumerator W C , Q ( x , y ) of C is a classifiable polynomial which encodes the distributions of C ’s codewords.” Scott Duke Kominers (Harvard) January 15, 2010 13

  56. Configurations of Extremal Type II Codes Methods Weight Enumerators Theta Function Slogan: “The weighted theta function Θ L , P ( τ ) of L is a modular form which encodes the distributions of L ’s vectors.” Weight Enumerator Slogan: “The harmonic weight enumerator W C , Q ( x , y ) of C is a classifiable polynomial which encodes the distributions of C ’s codewords.” Scott Duke Kominers (Harvard) January 15, 2010 13

  57. Configurations of Extremal Type II Codes Results Code Configuration Results Scott Duke Kominers (Harvard) January 15, 2010 14

  58. Configurations of Extremal Type II Codes Results Code Configuration Results Theorem Template If C is Type II and extremal of length n, then the minimal-weight codewords of C generate C. Scott Duke Kominers (Harvard) January 15, 2010 14

  59. Configurations of Extremal Type II Codes Results Code Configuration Results Theorem Template If C is Type II and extremal of length n, then the minimal-weight codewords of C generate C. Folklore(?): n ∈ { 8 , 24 } Scott Duke Kominers (Harvard) January 15, 2010 14

  60. Configurations of Extremal Type II Codes Results Code Configuration Results Theorem Template If C is Type II and extremal of length n, then the minimal-weight codewords of C generate C. Folklore(?): n ∈ { 8 , 24 } K. (2009): n ∈ { 32 , 48 , 56 , 72 , 96 } Scott Duke Kominers (Harvard) January 15, 2010 14

  61. Configurations of Extremal Type II Codes Results Code Configuration Results Theorem Template If C is Type II and extremal of length n, then the minimal-weight codewords of C generate C. Folklore(?): n ∈ { 8 , 24 } K. (2009): n ∈ { 32 , 48 , 56 , 72 , 96 } Likely: Analog of slightly weaker result for n ∈ { 40 , 80 , 120 } Scott Duke Kominers (Harvard) January 15, 2010 14

  62. Configurations of Extremal Type II Lattices and Codes Conclusion Scott Duke Kominers (Harvard) January 15, 2010 15

  63. Configurations of Extremal Type II Lattices and Codes Conclusion Lattices Codes Scott Duke Kominers (Harvard) January 15, 2010 15

  64. � Configurations of Extremal Type II Lattices and Codes Conclusion Lattices common Codes Scott Duke Kominers (Harvard) January 15, 2010 15

  65. � � Configurations of Extremal Type II Lattices and Codes Conclusion Lattices common uncommon Codes Scott Duke Kominers (Harvard) January 15, 2010 15

  66. Configurations of Extremal Type II Lattices and Codes Acknowledgments Scott Duke Kominers (Harvard) January 15, 2010 16

  67. Configurations of Extremal Type II Lattices and Codes Acknowledgments Prof. Noam D. Elkies Scott Duke Kominers (Harvard) January 15, 2010 16

  68. Configurations of Extremal Type II Lattices and Codes Acknowledgments Prof. Noam D. Elkies Mrs. Susan Schwartz Wildstrom Scott Duke Kominers (Harvard) January 15, 2010 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

Configurations of Extremal Even Unimodular Lattices Scott D. Kominers Harvard Mathematics

Configurations of Extremal Even Unimodular Lattices Scott D. Kominers Harvard Mathematics

Configurations of Extremal Even Unimodular Lattices Scott D. Kominers Harvard Mathematics Department Brown University SUMS March 8, 2008 Configurations of ExtremalEven Unimodular Lattices p. 1/33 Key Terms Configurations of ExtremalEven

1.04k views • 86 slides
Lattices from Codes or Codes from Lattices Amin Sakzad Dept of Electrical and Computer Systems

Lattices from Codes or Codes from Lattices Amin Sakzad Dept of Electrical and Computer Systems

Recall Cycle-Free Codes and Lattices Lattices from Codes Codes from Lattices Lattices from Codes or Codes from Lattices Amin Sakzad Dept of Electrical and Computer Systems Engineering Monash University amin.sakzad@monash.edu Oct. 2013

851 views • 55 slides
On extremal type III codes Darwin Villar RWTH-Aachen ALCOMA 15 Introduction ALgebraic Let

On extremal type III codes Darwin Villar RWTH-Aachen ALCOMA 15 Introduction ALgebraic Let

On extremal type III codes Darwin Villar RWTH-Aachen ALCOMA 15 Introduction ALgebraic Let be a self-dual [ , , ]- code over F q . COMbinatorics and Applications -ALCOMA Type I is -divisible or even and q =

451 views • 19 slides
Configurations in Lattices & Multiple Mixing Alex Gorodnik (University of Bristol) joint work

Configurations in Lattices & Multiple Mixing Alex Gorodnik (University of Bristol) joint work

Configurations in Lattices & Multiple Mixing Alex Gorodnik (University of Bristol) joint work with Michael Bj orklund and Manfred Einsiedler Configurations in R d Configurations in R d = a large subset of R d . Question Does

1.05k views • 69 slides
Lattices and Spherical Codes Sueli I. R. Costa University of Campinas sueli@ime.unicamp.br

Lattices and Spherical Codes Sueli I. R. Costa University of Campinas sueli@ime.unicamp.br

Lattices and Spherical Codes Sueli I. R. Costa University of Campinas sueli@ime.unicamp.br London-ish Lattice Coding & Crypto Meeting January, 15th, 2018 Abstract Lattices in R n with orthogonal sublattices are associated with spheri- cal

1.05k views • 61 slides
Type and type transition for random walks on randomly directed lattices To Iain MacPhee, in

Type and type transition for random walks on randomly directed lattices To Iain MacPhee, in

Generalities on random walks Algebraic and probabilistic structures Directed lattices Sketch of proofs Type and type transition for random walks on randomly directed lattices To Iain MacPhee, in memoriam Dimitri Petritis Joint work with

517 views • 32 slides
Automorphisms of extremal codes Gabriele Nebe Lehrstuhl D f ur Mathematik ALCOMA 15 Plan

Automorphisms of extremal codes Gabriele Nebe Lehrstuhl D f ur Mathematik ALCOMA 15 Plan

Automorphisms of extremal codes Gabriele Nebe Lehrstuhl D f ur Mathematik ALCOMA 15 Plan The use of symmetry Beautiful objects have symmetries. Symmetries help to reduce the search space for nice objects and hence make huge

470 views • 29 slides
Dessins denfants and transcendental lattices of singular K 3 surfaces Dessins denfants

Dessins denfants and transcendental lattices of singular K 3 surfaces Dessins denfants

Dessins denfants and transcendental lattices of singular K 3 surfaces Dessins denfants and transcendental lattices of extremal elliptic surfaces Saitama, 2008 March Ichiro Shimada (Hokkaido University) = (Hiroshima University)

826 views • 33 slides
On a recursive decoding algorithm for lattices Annika Meyer Workshop on lattices, codes and

On a recursive decoding algorithm for lattices Annika Meyer Workshop on lattices, codes and

On a recursive decoding algorithm for lattices Annika Meyer Workshop on lattices, codes and modular forms Aachen, 27.09.2011 Annika Meyer ( Workshop on lattices, codes and modular forms Aachen, 27.09.2011) On a recursive decoding algorithm for

856 views • 61 slides
Investigating the extremal martingale measures with pre-specified marginals Luciano Campi 1 ,

Investigating the extremal martingale measures with pre-specified marginals Luciano Campi 1 ,

Outline Martingale optimal transport problem Examples of optimal martingale transports Extremal points: motivation Douglas theorem and the WEP Characterizing the support of extremal points (countable case) Investigating the extremal martingale

915 views • 40 slides
TypeScript future and past othree @ modern web conf Notice Codes in this slide might be

TypeScript future and past othree @ modern web conf Notice Codes in this slide might be

TypeScript future and past othree @ modern web conf Notice Codes in this slide might be invalid Notice Codes in this slide might be invalid Even in the future Type JavaScript is dynamic type No type check at compile time and run

1.25k views • 86 slides
McEliece type Cryptosystem based on Gabidulin Codes Joachim Rosenthal University of Z urich

McEliece type Cryptosystem based on Gabidulin Codes Joachim Rosenthal University of Z urich

Traditional McEliece Crypto System Variants of McEliece System Distinguisher Attacks McEliece for Rank Metric Codes McEliece type Cryptosystem based on Gabidulin Codes Joachim Rosenthal University of Z urich ALCOMA, March 19, 2015 joint

763 views • 54 slides
A classification of self-dual codes with a rank 3 automorphism group of almost simple type

A classification of self-dual codes with a rank 3 automorphism group of almost simple type

A classification of self-dual codes with a rank 3 automorphism group of almost simple type Bernardo Rodrigues School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Durban, South Africa Groups St Andrews 2017

413 views • 30 slides
Lecture 9: Theta functions and lattices May 12, 2020 1 / 7 Lattices in R n A lattice is an

Lecture 9: Theta functions and lattices May 12, 2020 1 / 7 Lattices in R n A lattice is an

Lecture 9: Theta functions and lattices May 12, 2020 1 / 7 Lattices in R n A lattice is an additive subgroup R n such that Z n ( is free on n generators) b Z R R n ( spans the whole real vector space) # n +

246 views • 7 slides
Comparison Comparison of the proposed configurations of the proposed configurations for the

Comparison Comparison of the proposed configurations of the proposed configurations for the

Comparison Comparison of the proposed configurations of the proposed configurations for the AGATA array for the AGATA array E.Farnea INFN Sezione di Padova 1. Geometries 1. Geometries 1. What kind of configurations are we considering? 2.

391 views • 15 slides
Universal lower bounds for the energy of spherical codes: lifting the Levenshtein framework P.

Universal lower bounds for the energy of spherical codes: lifting the Levenshtein framework P.

Universal lower bounds for the energy of spherical codes: lifting the Levenshtein framework P. Boyvalenkov P. Dragnev D.Hardin E. Saff M. Stoyanova Optimal Point Configurations and Orthogonal Polynomials 2017 Castro Urdiales, Spain Linear

726 views • 23 slides
Policy Interactions within a Carbon-Pricing System Robert N. Stavins A. J. Meyer Professor of

Policy Interactions within a Carbon-Pricing System Robert N. Stavins A. J. Meyer Professor of

Policy Interactions within a Carbon-Pricing System Robert N. Stavins A. J. Meyer Professor of Energy and Economic Development John F. Kennedy School of Government, Harvard University Chinas National Carbon-Pricing System : Challenges and

415 views • 14 slides
Biostatistics Preparatory Course: Methods and Computing Lecture 9 Maximum Likelihood & the

Biostatistics Preparatory Course: Methods and Computing Lecture 9 Maximum Likelihood & the

Biostatistics Preparatory Course: Methods and Computing Lecture 9 Maximum Likelihood & the Bootstrap Methods and Computing Harvard University Department of Biostatistics 1 / 16 Overview: Maximum Likelihood Estimation Consider estimating a

455 views • 18 slides
Status of GArTPC software studies Justo Martn-Albo Harvard University The participants of the

Status of GArTPC software studies Justo Martn-Albo Harvard University The participants of the

Status of GArTPC software studies Justo Martn-Albo Harvard University The participants of the WS agreed that the following questions should be answered and documented in a docDB document: 1. What is the tracking efficiency as a function of

460 views • 5 slides
Annual general meeting 10 April 2019 Simon Thompson Chairman Sustainable energy Board of

Annual general meeting 10 April 2019 Simon Thompson Chairman Sustainable energy Board of

Annual general meeting 10 April 2019 Simon Thompson Chairman Sustainable energy Board of Directors Iron ore, Pilbara, Western Australia, Tom Price A strong 2018 $8.8bn $8.6bn 3% $4.1bn lower Underlying earnings Pre-tax asset sales CuE

540 views • 26 slides
Empirical Methods Research Landscape Qualitative = Constructivist approach Build theory

Empirical Methods Research Landscape Qualitative = Constructivist approach Build theory

Empirical Methods Research Landscape Qualitative = Constructivist approach Build theory from data Quantitative = Positivist/post-positivist approach Mixed methods = Pragmatist approach Experimental Analysis of Mode Switching

482 views • 36 slides
26:010:557 / 26:620:557 Social Science Research Methods Dr. Peter R. Gillett Associate

26:010:557 / 26:620:557 Social Science Research Methods Dr. Peter R. Gillett Associate

26:010:557 / 26:620:557 Social Science Research Methods Dr. Peter R. Gillett Associate Professor Department of Accounting & Information Systems Rutgers Business School Newark & New Brunswick Dr. Peter R Gillett April 21, 2006 1

692 views • 26 slides
Hawthorne E F F E C T Direct-to-patient clinical trial participation platform Pre-COVID

Hawthorne E F F E C T Direct-to-patient clinical trial participation platform Pre-COVID

The Rise of Decentralized Clinical Trials Remote Patient Participation is a viable solution EVEN for Complex Cardiovascular Clinical Trials. Jodi J. Akin, MSN Hawthorne E F F E C T Direct-to-patient clinical trial participation platform

655 views • 18 slides
Human factors: Intertwining of formal and empirical methods in software engineering HaPoC

Human factors: Intertwining of formal and empirical methods in software engineering HaPoC

Human factors: Intertwining of formal and empirical methods in software engineering HaPoC Symposium at IACAP-14 Conference of the International Association for Computing and Philosophy Thessaloniki, July 3rd 2014 Gonzalo Gnova

401 views • 12 slides

More recommend