activity
20142026
most citedThree-point bounds for sphere packing

7 citations · 11 across the 10 of their papers we have counts for

collaborators

12 papers

math.CO2026

The Rate of the Delsarte Bound for Binary Codes and Spheres

Andrew Salmon

We give the asymptotic rate of Delsarte's linear programming bound for binary codes and spherical codes. This extends previous work of the author which formulated and proved an ana…

math.CO2026

The half-rate linear programming bound for binary codes is

Andrew Salmon

In their work on sphere packing and the modular bootstrap, Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini conjectured the exact high-dimensional exponent of the Cohn-Elkies sph…

math.MG2026

Linear Programming Bounds for Fibered Sphere Packings

Andrew Salmon

We study linear programming (LP) bounds for sphere packings that fiber over translates of a fixed lattice of lower rank, as well as their dual formulations. In doing so, we place t…

math.OC2024

Nonexistence of finite-dimensional estimation algebras on closed smooth manifolds

Jiayi Kang, Andrew Salmon, Stephen Shing-Toung Yau

Estimation algebras have been extensively studied in Euclidean space, where finite-dimensional estimation algebras form the foundation of the Kalman and Benes filters, and have con…

math.AG2024

Unipotent nearby cycles and nearby cycles over general bases

Andrew Salmon

We show that under some conditions, two constructions of nearby cycles over general bases coincide. More specifically, we show that under the assumption of -factorizability, the…

math.AG2023

Restricted shtukas and -factorizable sheaves

Andrew Salmon

We show that Lusztig's theories of two-sided cells and non-unipotent representations of a reductive group over a finite field are compatible with the V. Lafforgue's automorphic-to-…

math.MG2022★ 7 cited

Three-point bounds for sphere packing

Henry Cohn, David de Laat, Andrew Salmon

We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a trunc…

math.MG2021★ 1 cited

Sphere packing bounds via rescaling

Henry Cohn, Andrew Salmon

We study the relationship between local and global density for sphere packings, and in particular the convergence of packing densities in large, compact regions to the Euclidean li…

math.AG2021

Unipotent nearby cycles and the cohomology of shtukas

Andrew Salmon

We give cases in which nearby cycles commutes with pushforward from sheaves on the moduli stack of shtukas to a product of curves over a finite field. The proof systematically uses…

math.CO2017

Topology of tropical moduli of weighted stable curves

Alois Cerbu, Steffen Marcus, Luke Peilen +2

The moduli space of tropical -weighted stable curves of volume is naturally identified with the dual complex of the divisor of singular curves in Hassett's spaces…

math.CO2017

Union of Random Trees and Applications

Austen James, Matthew Larson, Daniel Montealegre +1

In 1986, Janson showed that the number of edges in the union of random spanning trees in the complete graph is a shifted Poisson distribution. Using results from the theo…

math.CO2014★ 3 cited

On the choice number of complete multipartite graphs with part size four

H. A. Kierstead, Andrew Salmon, Ran Wang

Let denote the choice number of a graph , and let be the complete -partite graph with vertices in each part. Erdős, Rubin, and Taylor showed th…