English
Related papers

Related papers: Rank 72 high minimum norm lattices

200 papers

We study the shortest vector lengths in module lattices over arbitrary number fields, with an emphasis on cyclotomic fields. In particular, we sharpen the techniques of arXiv:2308.15275v2 to establish improved results for the variance of…

Number Theory · Mathematics 2025-10-16 Nihar Gargava , Vlad Serban , Maryna Viazovska , Ilaria Viglino

We develop categorical and number theoretical tools for the classification of super-modular categories. We apply these tools to obtain a partial classification of super-modular categories of rank $8$. In particular we find three distinct…

Quantum Algebra · Mathematics 2019-09-24 Paul Bruillard , Julia Yael Plavnik , Eric C. Rowell , Qing Zhang

Let G be a topological Kac-Moody group of rank 2 with symmetric Cartan matrix, defined over a finite field F_q. An example is G = SL(2,F_q((t^{-1}))). We determine a positive lower bound on the covolumes of cocompact lattices in G, and…

Group Theory · Mathematics 2020-01-21 Inna , Capdeboscq , Anne Thomas

In the first paper of this series, we constructed a family of lattices in dimensions 2^{n+1} for positive integers n, and proved that the associated lattice packings of spheres equal or exceed the previous records for several values of n.…

Number Theory · Mathematics 2007-05-23 Noam D. Elkies

By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…

Combinatorics · Mathematics 2026-03-19 Leen Aburub , Gergo Gyenizse

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…

Functional Analysis · Mathematics 2022-02-03 Radu Balan , Kasso A. Okoudjou , Michael Rawson , Yang Wang , Rui Zhang

We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite…

Rings and Algebras · Mathematics 2021-02-08 Leonard Kwuida , Claudia Mureşan

E. Bayer-Fluckiger gave a necessary and sufficient condition for a polynomial to be realized as the characteristic polynomial of a semisimple isometry of an even unimodular lattice, by describing the local-global obstruction, and the author…

Number Theory · Mathematics 2024-01-24 Yuta Takada

We propose a three-step program for the classification of stable rank 2 bundles on the projective space $\mathbb{P}^3$ inspired by an article by Hartshorne and Rao. While this classification program has been successfully completed for…

Algebraic Geometry · Mathematics 2023-02-08 Aislan Fontes , Marcos Jardim

We prove minimal entropy rigidity for complete, finite volume manifolds locally isometric to a product of rank one symmetric spaces of dimension at least 3: the locally symmetric metric uniquely minimizes (normalized) entropy among all…

Differential Geometry · Mathematics 2007-05-23 Christopher Connell , Benson Farb

For a smooth canonically embedded curve $C$ of genus $9$ together with a pencil $|L|$ of degree $6$, we study the relative canonical resolution of $C\subset X\subset \mathbb{P}^8$, where $X$ is the scroll swept out by the pencil $|L|$. We…

Algebraic Geometry · Mathematics 2021-04-27 Christian Bopp , Michael Hoff

The Coxeter lattices, which we denote $A_{n/m}$, are a family of lattices containing many of the important lattices in low dimensions. This includes $A_n$, $E_7$, $E_8$ and their duals $A_n^*$, $E_7^*$ and $E_8^*$. We consider the problem…

Information Theory · Computer Science 2016-11-17 Robby G. McKilliam , Warren D. Smith , I. Vaughan L. Clarkson

An even lattice $M$ of signature $(n,2)$ is called $2$-reflective if there is a non-constant modular form for the orthogonal group of $M$ which vanishes only on quadratic divisors orthogonal to $2$-roots of $M$. In [Amer. J. Math. 2017]…

Number Theory · Mathematics 2023-01-30 Haowu Wang

Shimada and Zhang studied the existence of polarizations on some supersingular $K3$ surfaces by reducing the existence of the polarizations to that of ternary $[12,5]$ codes satisfying certain conditions. In this note, we give a…

Combinatorics · Mathematics 2016-08-19 Makoto Araya , Masaaki Harada

Modular Tensor Categories (MTC's) arise in the study of certain condensed matter systems. There is an ongoing program to classify MTC's of low rank, up to modular data. We present an overview of the methods to classify modular tensor…

Quantum Algebra · Mathematics 2020-08-07 David Green

A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\sqrt n$. It is known that the bound is tight (up to…

Discrete Mathematics · Computer Science 2016-12-06 Mozhgan Pourmoradnasseri , Dirk Oliver Theis

We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…

We extend the results of Bey, Hen, and Wills (http://arxiv.org/abs/math/0606089). In this paper, we show that, up to equivalence under unimodular transformations, there is exactly one class of $d$-simplices having $k \ge 1$ interior lattice…

Combinatorics · Mathematics 2008-04-21 Han Duong

A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…

Group Theory · Mathematics 2010-06-22 Xinmin Lu , Dongsheng Liu , Zhinan Qi , Hourong Qin

A recent line of work on lattice codes for Gaussian wiretap channels introduced a new lattice invariant called secrecy gain as a code design criterion which captures the confusion that lattice coding produces at an eavesdropper. Following…

Number Theory · Mathematics 2013-04-17 Fuchun Lin , Frédérique Oggier , Patrick Solé