Related papers: High-dimensional sphere packing and the modular bo…
A holographic perspective to study and characterize field spaces that arise in string compactifications is suggested. A concrete correspondence is developed by studying two-dimensional moduli spaces in supersymmetric string…
We study the topology of the space of positive scalar curvature metrics on high dimensional spheres and other spin manifolds. Our main result provides elements of infinite order in higher homotopy and homology groups of these spaces, which,…
A complex spherical code is a finite subset on the unit sphere in $\mathbb{C}^d$. A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible…
We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is…
Using the numerical modular bootstrap, we constrain the space of 1+1d CFTs with a finite non-invertible global symmetry described by a fusion category $\mathcal{C}$. We derive universal and rigorous upper bounds on the lightest…
The isostatic jamming limit of frictionless spherical particles from Edwards' statistical mechanics [Song \emph{et al.}, Nature (London) {\bf 453}, 629 (2008)] is generalized to arbitrary dimension $d$ using a liquid-state description. The…
Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…
This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…
Random coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for $E$-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is…
We study constraints coming from the modular invariance of the partition function of two-dimensional conformal field theories. We constrain the spectrum of CFTs in the presence of holomorphic and anti-holomorphic currents using the…
In this work we revisit the "holomorphic modular bootstrap", i.e. the classification of rational conformal field theories via an analysis of the modular differential equations satisfied by their characters. By making use of the…
Various observables in compact CFTs are required to obey positivity, discreteness, and integrality. Positivity forms the crux of the conformal bootstrap, but understanding of the abstract implications of discreteness and integrality for the…
We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond…
We study massive $2 \to 2$ scattering of identical scalar particles in spacetime dimensions 3 to 11 using non-perturbative S-matrix bootstrap techniques. Treating $d$ as a continuous parameter, we compute two-sided numerical bounds on…
In recent years the conformal bootstrap has produced surprisingly tight bounds on many non-perturbative CFTs. It is an open question whether such bounds are indeed saturated by these CFTs. A toy version of this question appears in a recent…
Current constraints on spatial curvature show that it is dynamically negligible: $|\Omega_{\rm K}| \lesssim 5 \times 10^{-3}$ (95% CL). Neglecting it as a cosmological parameter would be premature however, as more stringent constraints on…
We prove that given a fixed radius $r$, the set of isometry-invariant probability measures supported on ``periodic'' radius $r$-circle packings of the hyperbolic plane is dense in the space of all isometry-invariant probability measures on…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…
We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via…
We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn-Triantafillou to the case of…