Let $\Lambda \subseteq \mathbb{R}^n$ be a full rank lattice with the property that $\det \Gamma \ge 1$ for all sublattices $\Gamma \subseteq \Lambda^*$. We prove that there exists a symmetric random vector $X \in \mathbb{R}^n$ with a smooth, strictly positive density $f : \mathbb{R}^n \to (0, \infty)$ satisfying that (1) $f$ is $\alpha$-strongly log-concave, where $\alpha = 2\pi/e$, and (2) $X + \Lambda$ is uniform on $\mathbb{R}^n/\Lambda$. Moreover, the existence of such a density characterizes this property up to a universal dilation. There are a few consequences of the above. We list some. First, for such lattices we can bound the covering radius \[ \mu(\Lambda, K) = \max_{x\in\mathbb{R}^n}\min_{\lambda\in\Lambda} \left\|x-\lambda\right\|_K \le \sqrt{\frac{2e}{\pi}} \cdot \mathbb{E}\,\left\|G\right\|_K \] of a convex body $K \subseteq \mathbb{R}^n$ containing $0$ in its interior, where $G \sim N(0,\mathrm{Id})$. This implies an $O(n \sqrt{\log n})$ bound for the flatness constant and an $O(\log^{3/2} n)$ bound for the subspace flatness constant. We also compare the entire ordered spectrum of the associated flat torus on $\Lambda^*$ with that of a Gaussian, yielding an alternative proof of the reverse Minkowski theorem.
We introduce an explicit deterministic collection of $N$ spherical points, $\cP_N\subset\mathbb S^2$, that we call the {\em deterministic Diamond points}. For every $0<\alpha<2$ we prove that there exists a constant $C_\alpha>0$ such that \[ 0\leq \frac{2^{\alpha+1}}{\alpha+2}N^2-\sum_{x,y\in\cP_N}|x-y|^\alpha \le C_\a...
C. Beltrán, J. Marzo, J. Ortega-Cerdá· 0 citations
Let $\kappa_p(n)$ denote the maximum kissing number of a lattice $\mathcal{L} \subset \mathbb{R}^n$. We prove that $\kappa_p(n) \geq 2^{\Omega(\sqrt{n})}$ for all $p\ge 1$ and that $\kappa_p(n) \geq \Omega(\alpha_p^n)$ for all $p>2$, where $\alpha_p>1$ is a constant depending only on $p$. In particular, our former resu...
Huck Bennett, Minki Hhan, Zi-Han Li et al.· 0 citations
We consider generalizations of the classical Fourier uniqueness theorem. First, we construct a family of uniformly discrete sets $\Lambda \subset \mathbb{R}$, of uniform density one, such that the exponential system $\{e^{2\pi i\lambda x} : \lambda \in \Lambda\}$ is complete in $L^p(S)$ for every $1 \leq p<\infty$ and...
Susanna Bertolini, Enric Florit-Simon, Lukas Liehr et al.· 0 citations
Let $A$ be the (non-symmetric) adjacency matrix of a uniformly random $d$-regular directed graph on $n$ vertices, and let $\Xi$ be independent of $A$ with i.i.d. Rademacher entries. Suppose that $\min(d,n-d)\ge\lambda n$ for some fixed $\lambda\in(0,1/2]$. We show that there exists $c>0$, depending only on $\lambda$, s...
Huai-Jin Liang, Yu-Xiao Shi, Ke-Xin Yu et al.· 1 citation
Let $A$ be the adjacency matrix of $G\sim G(n,1/2)$, let $D=\operatorname{diag}(A\mathbf{1})$, and let $\Lambda_G=\mathbb{Z}\langle A,D\rangle\mathbf{1}$. We prove $\Pr[\Lambda_G\ne\mathbb{Z}^n]\le n^{-3/20+o(1)}$. Thus two dependent graph operators generate the entire vertex lattice from the constant vector, simultane...
The eigenvalue problem for a probability measure $\mu$ with compact support in $\R$ is whether there exist a countable set $\Lambda$ and a nonzero real $t\ne 1$ such that both $\Lambda$ and $t\Lambda$ are spectra of $\mu$, that is, the family $$E_{a\Lambda}=\{e^{-2\pi i a\lambda x}:\lambda\in\Lambda\}$$ is an orthonorm...
Xing-Gang He, Zhi-Yi Wu, Feng-Li Yin· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.