Related papers: The second minimum of Barnes-Wall lattices

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…

We consider the well-known Rosenbloom-Tsfasman function field lattices in the special case of Hermitian function fields. We show that in this case the resulting lattices are generated by their minimal vectors, provide an estimate on the…

In this short note we prove a sharp lower bound for the second moment of a lattice Voronoi cell in terms of the respective covering radius. This gives an affirmative answer to a conjecture by Haviv, Lyubashevsky and Regev. We also…

We discuss translation minimal surfaces, homothetical minimal surfaces, and separable minimal surfaces in the $3$-space with $2m$-norm.

In this paper, we prove that the $3$-sphere endowed with an arbitrary Riemannian metric either contains at least two embedded minimal $2$-spheres or admits an optimal foliation by $2$-spheres. This generalizes recent results by…

We prove that the standard double bubble provides the least-area way to enclose and separate two regions of prescribed volume in \Bbb R^3.

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

The aim of this note is to prove that almost-minimizers of the perimeter are Reifenberg flat, for a very weak notion of minimality. The main observation is that smallness of the excess at some scale implies smallness of the excess at all…

In 2024, Kliuchnikov and Sch\"onnenbeck showed a connection between the Barnes Wall lattices, stabilizer states and Clifford operations. In this work, we study their results and relate them to the problem of lower bounding stabilizer ranks.…

Suppose that every non-minimal bridge position of a knot $K$ is perturbed. We show that if $L$ is a $(2, 2q)$-cable link of $K$, then every non-minimal bridge position of $L$ is also perturbed.

We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing R from the…

A new lower bound on the average reconstruction error variance of multidimensional sampling and reconstruction is presented. It applies to sampling on arbitrary lattices in arbitrary dimensions, assuming a stochastic process with constant,…

We settle an open problem of several years standing by showing that the least-squares mean for positive definite matrices is monotone for the usual (Loewner) order. Indeed we show this is a special case of its appropriate generalization to…

This paper is essentially an exercise in studying the minima of a certain least squares optimization using the second partial derivative test. The motivation is to gain insight into an optimization-based solution to the problem of tracking…

We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…

We give an exponential lower bound for Berge-Ramsey problems.

Let $\lambda_k$ denote the $k$-th successive minimum of a lattice $L$. We study properties of the lengths of certain bases of $L$. If $v_1, \dots v_n$ is a basis which is reduced in the sense of Minkowski we show that $\lvert v_k \rvert^2…

We study the double bubble problem with perimeter taken with respect to the $\ell_1$ norm on $\mathbb{R}^2$. We give an elementary proof for the existence of minimizing sets for any volume ratio parameter $0<\alpha\le1$ by direct comparison…

We say that $G$ is a $(3, 3)$-Ramsey graph if every $2$-coloring of the edges of $G$ forces a monochromatic triangle. The $(3, 3)$-Ramsey graph $G$ is minimal if $G$ does not contain a proper $(3, 3)$-Ramsey subgraph. In this work we find…