English
Related papers

Related papers: The Sphere Packing Bound via Augustin's Method

200 papers

Let L be a link in the 3-sphere that is in thin position but not in bridge position and let P be a thin level sphere. We generalize a result of Wu by giving a bound on the number of disjoint irreducible compressing disks that P can have,…

Geometric Topology · Mathematics 2007-05-23 Maggy Tomova

The Tomas-Stein inequality for a compact subset $\Gamma$ of the sphere $S^d$ states that the mapping $f\mapsto \widehat{f\sigma}$ is bounded from $L^2(\Gamma,\sigma)$ to $L^{2+4/d}(\R^{d+1})$. Then conditional on a strict comparison between…

Classical Analysis and ODEs · Mathematics 2026-05-26 Shuanglin Shao , Ming Wang

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing…

Information Theory · Computer Science 2016-01-25 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

Combinatorics · Mathematics 2016-06-07 Jesse Geneson

Suppose that $\{G_n\}$ is a sequence of finite graphs such that each $G_n$ is the tangency graph of a sphere packing in $\mathbb{R}^d$. Let $\rho_n$ be a uniformly random vertex of $G_n$ and suppose that $(G,\rho)$ is the distributional…

Metric Geometry · Mathematics 2018-02-13 James R. Lee

The sphere-packing bound quantifies the error exponent for noisy channel coding for rates above a critical value. Here, we study the zero-rate limit of the sphere-packing bound and show that it has an intriguing single-letter form, which we…

Information Theory · Computer Science 2025-09-03 Filippo Girardi , Aadil Oufkir , Bartosz Regula , Marco Tomamichel , Mario Berta , Ludovico Lami

We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically…

Information Theory · Computer Science 2017-01-13 Lan V. Truong , Vincent Y. F. Tan

This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary…

Information Theory · Computer Science 2019-02-04 Rahul Devassy , Giuseppe Durisi , Guido Carlo Ferrante , Osvaldo Simeone , Elif Uysal

For any given natural number $k$, this paper gives upper bounds on the radius of a packing of a complete hyperbolic surface of finite area by $k$ equal-radius disks in terms of the surface's topology. We show that the bounds given here are…

Geometric Topology · Mathematics 2018-06-11 Jason DeBlois

The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if completed, will jointly comprise a proof of the conjecture. We carry out step five of the program [outlined in math.MG/9811073], a proof…

Metric Geometry · Mathematics 2007-05-23 Samuel P. Ferguson

In this paper we give an algorithm to round the floating point output of a semidefinite programming solver to a solution over the rationals or a quadratic extension of the rationals. We apply this to get sharp bounds for packing problems,…

Optimization and Control · Mathematics 2020-07-10 Maria Dostert , David de Laat , Philippe Moustrou

The spectral gap of a Markov chain can be bounded by the spectral gaps of constituent "restriction" chains and a "projection" chain, and the strength of such a bound is the content of various decomposition theorems. In this paper, we…

Data Structures and Algorithms · Computer Science 2019-10-14 Sarah Miracle , Amanda Pascoe Streib , Noah Streib

Maximally random jammed states of hard spheres are prototypical glasses. We study the small wavenumber $k$ behavior of the structure factor $S(k)$ of overcompressed million-sphere packings as a function of density up to the jammed state. We…

Statistical Mechanics · Physics 2013-05-30 Adam B. Hopkins , Frank H. Stillinger , Salvatore Torquato

We establish upper and lower universal bounds for potentials of weighted designs on the sphere $\mathbb{S}^{n-1}$ that depend only on quadrature nodes and weights derived from the design structure. Our bounds hold for a large class of…

Metric Geometry · Mathematics 2024-12-11 S. Borodachov , P. Boyvalenkov , P. Dragnev , D. Hardin , E. Saff , M. Stoyanova

This paper studies the capacity of an $n$-dimensional vector Gaussian noise channel subject to the constraint that an input must lie in the ball of radius $R$ centered at the origin. It is known that in this setting the optimizing input…

Information Theory · Computer Science 2018-09-25 Alex Dytso , Mert Al , H. Vincent Poor , Shlomo Shamai

We establish a precise relation between the modular bootstrap, used to constrain the spectrum of 2D CFTs, and the sphere packing problem in Euclidean geometry. The modular bootstrap bound for chiral algebra $U(1)^c$ maps exactly to the…

High Energy Physics - Theory · Physics 2020-01-29 Thomas Hartman , Dalimil Mazáč , Leonardo Rastelli

We consider the problem of finding an $N$-point configuration on the sphere $S^d\subset \RR^{d+1}$ with the smallest absolute maximum value over $S^d$ of its total potential. The potential induced by each point ${\bf y}$ in a given…

Classical Analysis and ODEs · Mathematics 2022-03-28 Sergiy Borodachov

We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable…

Information Theory · Computer Science 2015-12-01 Chong Li , Nicola Elia

We improve Frank-Sabin's work concerning the spectral cluster bounds for orthonormal systems at $p=\infty$, on the flat torus and spaces of nonpositive sectional curvature, by shrinking the spectral band from $[\lambda^{2},…

Analysis of PDEs · Mathematics 2023-07-24 Tianyi Ren , An Zhang

We show that if $Y$ is a compact Riemannian manifold with improved $L^q$ eigenfunction estimates then, at least for large enough exponents, one always obtains improved $L^q$ bounds on the product manifold $X\times Y$ if $X$ is another…

Analysis of PDEs · Mathematics 2022-05-11 Xiaoqi Huang , Christopher D. Sogge , Michael E. Taylor