English
Related papers

Related papers: The second minimum of Barnes-Wall lattices

200 papers

We consider minimal-perimeter lattice animals, providing a set of conditions which are sufficient for a lattice to have the property that inflating all minimal-perimeter animals of a certain size yields (without repetitions) all…

Computational Geometry · Computer Science 2022-06-01 Gill Barequet , Gil Ben-Shachar

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…

Metric Geometry · Mathematics 2007-05-23 Martin Henk

Let $L$ be a lattice of finite length and let $d$ denote the minimum path length metric on the covering graph of $L$. For any $\xi=(x_1,\dots,x_k)\in L^k$, an element $y$ belonging to $L$ is called a median of $\xi$ if the sum…

Rings and Algebras · Mathematics 2019-11-07 Gábor Czédli , Robert C. Powers , Jeremy M. White

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

Combinatorics · Mathematics 2018-07-27 Daniel R. Hawtin , Cheryl E. Praeger

In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbol{\alpha}\}),$ $(\{a_n\boldsymbol{\alpha}\})$ and…

Number Theory · Mathematics 2024-04-09 Tanmoy Bera

The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$. Using the zero forcing number, we prove that the minimum rank of…

Combinatorics · Mathematics 2019-03-28 Daniela Ferrero , Cyriac Grigorious , Thomas Kalinowski , Joe Ryan , Sudeep Stephen

We give an elementary proof of low rank cases of the conjecture that the tensor product of two semistable Euclidean lattices is again semistable.

Metric Geometry · Mathematics 2012-11-16 Ehud de Shalit , Ori Parzanchevski

Mainly, we correct the uniqueness result by adding a projection requirement to condition X and give a better proof for the equivalence of commutator density, 2/4-generation and 3/4-generation.

Group Theory · Mathematics 2007-05-23 Robert L. Griess

We give a simple description of rectangular matrices that can be implemented by a post-selected stabilizer circuit. Given a matrix with entries in dyadic cyclotomic number fields $\mathbb{Q}(\exp(i\frac{2\pi}{2^m}))$, we show that it can be…

Quantum Physics · Physics 2024-05-31 Vadym Kliuchnikov , Sebastian Schönnenbeck

Let $\pi$ be a Hecke cusp form for $\mathrm{SL}_3(\mathbb{Z})$. We bound the second moment average of $L(s,\pi)$ over a short interval to obtain the subconvexity estimate $$ L(1/2+it, \pi) \ll_{\pi, \varepsilon}…

Number Theory · Mathematics 2025-09-23 Keshav Aggarwal , Wing Hong Leung , Ritabrata Munshi

We prove the following results on flag triangulations of 2- and 3-manifolds. In dimension 2, we prove that the vertex-minimal flag triangulations of $\mathbb{R} P^2$ and $\mathbb{S}^1\times \mathbb{S}^1$ have 11 and 12 vertices,…

Combinatorics · Mathematics 2020-11-25 Christin Bibby , Andrew Odesky , Mengmeng Wang , Shuyang Wang , Ziyi Zhang , Hailun Zheng

In this paper we consider the minimal polynomial $\psi_n(x)$ of $2\cos (2\pi /n)$. We introduce some polynomial sequences with the same recurrence relation as the rescaled Chebyshev polynomials $t_n(x)=2\, T_n(x/2)$ of the first kind, which…

General Mathematics · Mathematics 2025-04-25 Mamoru Doi

The lower bound W(K_{2n})>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K_{2n}.

Discrete Mathematics · Computer Science 2007-12-18 Rafael R. Kamalian , Petros A. Petrosyan

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower…

Combinatorics · Mathematics 2023-01-25 Ichiro Sainose , Ginji Hamano , Tatsuo Emura , Takayuki Hibi

We present a conjecture, based on computational results, on the area minimizing way to enclose and separate two arbitrary volumes in the flat cubic 3-torus. For comparable small volumes, we prove that an area minimizing double bubble in the…

Differential Geometry · Mathematics 2019-02-07 Miguel Carrión-Álvarez , Joseph Corneli , Genevieve Walsh , Shabnam Beheshti

Let $d_i(m)$ denote the coefficients of the Boros-Moll polynomials. Moll's minimum conjecture states that the sequence $\{i(i+1)(d_i^2(m)-d_{i-1}(m)d_{i+1}(m))\}_{1\leq i \leq m}$ attains its minimum with $i=m$. This conjecture is a…

Combinatorics · Mathematics 2009-04-07 William Y. C. Chen , Ernest X. W. Xia

We consider a two-dimensional analogue of Jacobi theta functions and prove that, among all lattices $\Lambda \subset \mathbb{R}^2$ with fixed density, the minimal value is maximized by the hexagonal lattice. This result can be interpreted…

Classical Analysis and ODEs · Mathematics 2021-10-13 Laurent Bétermin , Markus Faulhuber , Stefan Steinerberger

We show that, if L is an extremal Type II lattice of rank 40 or 80, then L is generated by its vectors of norm min(L)+2. This sharpens earlier results of Ozeki, and the second author and Abel, which showed that such lattices L are generated…

Number Theory · Mathematics 2011-01-04 Noam D. Elkies , Scott D. Kominers

The purpose of this note is to give a self contained description of Walls finiteness obstruction.

Geometric Topology · Mathematics 2017-07-26 Erik Kjær Pedersen

The 'thin-wall approximation' gives a simple estimate of the decay rate of an unstable quantum field. Unfortunately, the approximation is uncontrolled. In this paper I show that there are actually two different thin-wall approximations and…

High Energy Physics - Theory · Physics 2018-11-28 Adam R. Brown