Browsing Henry Cohn by Issue Date

Now showing items 1-13 of 13

    • Data for "An optimal uncertainty principle in twelve dimensions via modular forms" 

      Cohn, Henry; Gonçalves, Felipe (2018-09-24)
      This data set includes all the numerical data referred to in the paper "An optimal uncertainty principle in twelve dimensions via modular forms" by Cohn and Gonçalves (available on the arXiv with arXiv ID 1712.04438, at ...

    • Modular bootstrap data 

      Afkhami-Jeddi, Nima; Cohn, Henry; Hartman, Thomas; de Laat, David; Tajdini, Amirhossein (2020-06-03)
      This data set includes the numerical data from the papers "High-dimensional sphere packing and the modular bootstrap" (by Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini) and "Free partition functions and an averaged ...

    • Data for "Dual linear programming bounds for sphere packing via modular forms" 

      Cohn, Henry; Triantafillou, Nicholas (2021-04-04)
      This data set contains numerical data for the paper "Dual linear programming bounds for sphere packing via modular forms" by Cohn and Triantafillou (available on the arXiv with arXiv ID 1909.04772, at the URL https://arX ...

    • Point configurations minimizing harmonic energy on spheres 

      Ballinger, Brandon; Blekherman, Grigoriy; Cohn, Henry; Giansiracusa, Noah; Kelly, Elizabeth; e.a. (2021-06-13)
      This data set contains updated numerical data for the paper "Experimental study of energy-minimizing point configurations on spheres" (Experiment. Math. 18 (2009), no. 3, 257-283).

    • Computer-assisted proof of kernel inequalities 

      Cohn, Henry; Kumar, Abhinav; Miller, Stephen D.; Radchenko, Danylo; Viazovska, Maryna (2022-03-16)
      This data set provides a computer-assisted proof for the kernel inequalities needed to prove universal optimality in the paper "Universal optimality of the E_8 and Leech lattices and interpolation formulas" (by Cohn, Kumar, ...

    • Small spherical and projective codes 

      Cohn, Henry (2022-05-23)
      This data set describes the best spherical and real projective codes that are known to exist (to the best of my knowledge), for up to 32 points on spheres or 16 lines through the origin in the real projective case. It ...

    • Data for "Three-point bounds for sphere packing" 

      Cohn, Henry; de Laat, David; Salmon, Andrew (2022-06-29)
      This data set includes all the numerical data from the paper "Three-point bounds for sphere packing" by Cohn, de Laat, and Salmon.

    • Sloane's tables of point configurations on spheres 

      Unknown author (2023-01-07)
      These tables of point configurations on spheres were created by N. J. A. Sloane based on joint work with R. H. Hardin, W. D. Smith, and others. Sloane has since retired from AT&T Labs, and Henry Cohn has taken over maintaining ...

    • Grassmannian packings 

      Unknown author (2023-01-08)
      This table of Grassmannian packings was created by N. J. A. Sloane based on joint work with R. H. Hardin and J. H. Conway in "Packing lines, planes, etc.: packings in Grassmannian spaces" (Experiment. Math. 5 (1996), ...

    • Table of sphere packing density bounds 

      Cohn, Henry (2024-01-15)
      This table shows the best lower and upper bounds known for the packing density of congruent spheres in Euclidean spaces of dimensions 1 through 48, 56, 64, and 72.

    • Table of kissing number bounds 

      Cohn, Henry (2024-01-16)
      This table shows the best lower and upper bounds known for the kissing number in Euclidean spaces of dimensions 1 through 48 and 72.

    • Table of spherical codes 

      Cohn, Henry (2024-02-18)
      This table lists the best spherical codes I am aware of with up to 1024 points in up to 32 dimensions. It archives the data from https://spherical-codes.org in a form more suitable for citation, since it is likely to be ...

    • Data for "Optimality of spherical codes via exact semidefinite programming bounds" 

      Cohn, Henry; de Laat, David; Leijenhorst, Nando (2024-03-25)
      This data set includes all the code and data from the paper "Optimality of spherical codes via exact semidefinite programming bounds" by Cohn, de Laat, and Leijenhorst.