Related papers: Linear programming bounds in homogeneous spaces, I…
Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.
How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…
We classify the metric spaces that can be approximated by finite homogeneous ones.
In this paper, we prove $L^2 \to L^p$ estimates, where $p>2$, for spectral projectors on a wide class of hyperbolic surfaces. More precisely, we consider projections in small spectral windows $[\lambda-\eta,\lambda+\eta]$ on geometrically…
Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
We study the two weight quantitative estimates for the commutator of maximal functions and the maximal commutators with respect to the symbol in weighted BMO space on spaces of homogeneous type. These commutators turn out to be controlled…
This paper describes the local density inequality approach to getting upper bounds for sphere packing densities in R^n. This approach was first suggested by L. Fejes-Toth in 1956 to prove the Kepler conjecture that the densest sphere…
In this paper, a result of Albert, Atkinson, Handley, Holton, and Stromquist [Electron. J. Combin. 9 (2002), #R5] which characterizes the optimal packing behavior of the pattern 1243 is generalized in two directions. The packing densities…
A permutation is layered if it contains neither 231 nor 312 as a pattern. It is known that, if $\sigma$ is a layered permutation, then the density of $\sigma$ in a permutation of order $n$ is maximized by a layered permutation. Albert,…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO…
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…
We study approximation and localized polynomial frames on a bounded double hyperbolic or conic surface and the domain bounded by such a surface and hyperplanes. The main work follows the framework developed recently in \cite{X21} for…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
We derive a necessary and sufficient condition on a hyperplane arrangement in $\mathbb{P}^n$ for the associated logarithmic cotangent bundle to be ample modulo boundary. We extend this result to the orbifold setting and give some…
Conditions are established under which the optimal control of processes having both absolutely continuous and singular (with respect to time) controls are equivalent to linear programs over a space of measures on the state and control…
Koszul type Coxeter simplex tilings exist in hyperbolic $n$-space $\mathbb{H}^n$ up to $ n = 9$, and their horoball packings achieve the highest known regular ball packing densities for $n = 3, 4, 5$. In this paper we determine the optimal…
We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a…
We quantify the physical memory of the cosmic density field using mutual information between $N$-body snapshots at different redshifts, removing a random baseline to isolate gravitational correlations. The shared mutual information rises…