Kissing numbers and transference theorems from generalized tail bounds

We generalize Banaszczyk's seminal tail bound for the Gaussian mass of a lattice to a wide class of test functions. From this we obtain quite general transference bounds, as well as bounds on the number of lattice points contained in certain bodies. As applications, we bound the lattice kissing number in $\ell_p$ norms by $e^{(n+ o(n))/p}$ for $0 < p \leq 2$, and also give a proof of a new transference bound in the $\ell_1$ norm.Comment: Previous title: "Generalizations of Banaszczyk's transference theorems and tail bound

A dimensionally continued Poisson summation formula

We generalize the standard Poisson summation formula for lattices so that it operates on the level of theta series, allowing us to introduce noninteger dimension parameters (using the dimensionally continued Fourier transform). When combined with one of the proofs of the Jacobi imaginary transformation of theta functions that does not use the Poisson summation formula, our proof of this generalized Poisson summation formula also provides a new proof of the standard Poisson summation formula for dimensions greater than 2 (with appropriate hypotheses on the function being summed). In general, our methods work to establish the (Voronoi) summation formulae associated with functions satisfying (modular) transformations of the Jacobi imaginary type by means of a density argument (as opposed to the usual Mellin transform approach). In particular, we construct a family of generalized theta series from Jacobi theta functions from which these summation formulae can be obtained. This family contains several families of modular forms, but is significantly more general than any of them. Our result also relaxes several of the hypotheses in the standard statements of these summation formulae. The density result we prove for Gaussians in the Schwartz space may be of independent interest.Comment: 12 pages, version accepted by JFAA, with various additions and improvement

Universal optimality of the E8E_8 and Leech lattices and interpolation formulas

We prove that the $E_8$ root lattice and the Leech lattice are universally optimal among point configurations in Euclidean spaces of dimensions $8$ and $24$, respectively. In other words, they minimize energy for every potential function that is a completely monotonic function of squared distance (for example, inverse power laws or Gaussians), which is a strong form of robustness not previously known for any configuration in more than one dimension. This theorem implies their recently shown optimality as sphere packings, and broadly generalizes it to allow for long-range interactions. The proof uses sharp linear programming bounds for energy. To construct the optimal auxiliary functions used to attain these bounds, we prove a new interpolation theorem, which is of independent interest. It reconstructs a radial Schwartz function $f$ from the values and radial derivatives of $f$ and its Fourier transform $\widehat{f}$ at the radii $\sqrt{2n}$ for integers $n\ge1$ in $\mathbb{R}^8$ and $n \ge 2$ in $\mathbb{R}^{24}$. To prove this theorem, we construct an interpolation basis using integral transforms of quasimodular forms, generalizing Viazovska's work on sphere packing and placing it in the context of a more conceptual theory.Comment: 95 pages, 6 figure

Semantically Secure Lattice Codes for Compound MIMO Channels

We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for the special case of isotropic mutual information, which serves as a conservative strategy for general cases. Using the flatness factor for MIMO channels, we propose lattice codes universally achieving the secrecy capacity of compound MIMO wiretap channels up to a constant gap (measured in nats) that is equal to the number of transmit antennas. The proposed approach improves upon existing works on secrecy coding for MIMO wiretap channels from an error probability perspective, and establishes information theoretic security (in fact semantic security). We also give an algebraic construction to reduce the code design complexity, as well as the decoding complexity of the legitimate receiver. Thanks to the algebraic structures of number fields and division algebras, our code construction for compound MIMO wiretap channels can be reduced to that for Gaussian wiretap channels, up to some additional gap to secrecy capacity.Comment: IEEE Trans. Information Theory, to appea

Solving the Closest Vector Problem in 2n2^n Time--- The Discrete Gaussian Strikes Again!

We give a $2^{n+o(n)}$-time and space randomized algorithm for solving the exact Closest Vector Problem (CVP) on $n$-dimensional Euclidean lattices. This improves on the previous fastest algorithm, the deterministic $\widetilde{O}(4^{n})$-time and $\widetilde{O}(2^{n})$-space algorithm of Micciancio and Voulgaris. We achieve our main result in three steps. First, we show how to modify the sampling algorithm from [ADRS15] to solve the problem of discrete Gaussian sampling over lattice shifts, $L- t$, with very low parameters. While the actual algorithm is a natural generalization of [ADRS15], the analysis uses substantial new ideas. This yields a $2^{n+o(n)}$-time algorithm for approximate CVP for any approximation factor $\gamma = 1+2^{-o(n/\log n)}$. Second, we show that the approximate closest vectors to a target vector $t$ can be grouped into "lower-dimensional clusters," and we use this to obtain a recursive reduction from exact CVP to a variant of approximate CVP that "behaves well with these clusters." Third, we show that our discrete Gaussian sampling algorithm can be used to solve this variant of approximate CVP. The analysis depends crucially on some new properties of the discrete Gaussian distribution and approximate closest vectors, which might be of independent interest

Directed Polymers on Hierarchical Lattices with site disorder

We study a polymer model on hierarchical lattices very close to the one introduced and studied in \cite{DGr, CD}. For this model, we prove the existence of free energy and derive the necessary and sufficient condition for which very strong disorder holds for all \gb, and give some accurate results on the behavior of the free energy at high-temperature. We obtain these results by using a combination of fractional moment method and change of measure over the environment to obtain an upper bound, and second moment method to get a lower bound. We also get lower bounds on the fluctuation exponent of $\log Z_n$, and study the infinite polymer measure in the weak disorder phase