中文
相关论文

相关论文: A Note on Optimal Unimodular Lattices

200 篇论文

We study the maximal number of pairwise distinct columns in a $\Delta$-modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of $O(m^2)$ for fixed $\Delta$. We complement this and…

组合数学 · 数学 2022-07-12 Gennadiy Averkov , Matthias Schymura

This paper proves the following results: Besides parallelograms and centrally symmetric hexagons, there is no other convex domain which can form a two-, three- or four-fold lattice tiling in the Euclidean plane. If a centrally symmetric…

度量几何 · 数学 2019-11-13 Qi Yang , Chuanming Zong

We show that the maximum number of unit distances or of diameters in a set of n points in d-dimensional Euclidean space is attained only by specific types of Lenz constructions, for all d >= 4 and n sufficiently large, depending on d. As a…

度量几何 · 数学 2009-03-12 Konrad J Swanepoel

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

代数几何 · 数学 2019-10-09 Takuro Abe , Alexandru Dimca

This paper partially addresses the problem of characterizing the lengths of vectors in a family of Euclidean lattices that arise from any CM number field. We define a modified quadratic form on these lattices, the weighted norm, that…

数论 · 数学 2012-10-31 Jacob McNamara

We characterize all residuated lattices that have height equal to $3$ and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint…

逻辑 · 数学 2023-04-13 Nick Galatos , Xiao Zhuang

In this paper, we study the unimodular equivalence of sublattices in an $n$-dimensional lattice. A recursive procedure is given to compute the cardinalities of the unimodular equivalent classes with the indices which are powers of a prime…

度量几何 · 数学 2023-10-20 Shikui Shang

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

组合数学 · 数学 2009-01-13 Jaron Treutlein

Consider an arbitrary $n$-dimensional lattice $\Lambda$ such that $\mathbb{Z}^n \subset \Lambda \subset \mathbb{Q}^n$. Such lattices are called {\it rational} and can always be obtained by adding $m \le n$ rational vectors to…

数论 · 数学 2020-01-08 Mikhail Fadin

We prove that up to scaling there are only finitely many integral lattices L of signature (2,n) with n>20 or n=17 such that the modular variety defined by the orthogonal group of L is not of general type. In particular, when n>107, every…

代数几何 · 数学 2018-07-04 Shouhei Ma

One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…

最优化与控制 · 数学 2026-03-18 Stefan Kuhlmann , Robert Weismantel

Lattices with a circulant generator matrix represent a subclass of cyclic lattices. This subclass can be described by a basis containing a vector and its circular shifts. In this paper, we present certain conditions under which the norm…

信息论 · 计算机科学 2023-07-07 William Lima da Silva Pinto , Carina Alves

Orders in number fields provide natural examples of lattices. We ask: what can the successive minima of lattices arising from orders in number fields be? Given an order $\mathcal{O}$ of absolute discriminant $\Delta$ in a degree $n$ number…

数论 · 数学 2025-07-08 Sameera Vemulapalli

We construct a hollow lattice polytope (resp. a hollow lattice simplex) of dimension $14$ (resp.$~404$) and of width $15$ (resp.$~408$). They are the first known hollow lattice polytopes of width larger than dimension. We also construct a…

组合数学 · 数学 2019-12-24 Giulia Codenotti , Francisco Santos

A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…

度量几何 · 数学 2022-01-26 Vitaliy Kurlin

Unimodular triangulations of lattice polytopes arise in algebraic geometry, commutative algebra, integer programming and, of course, combinatorics. In this article, we review several classes of polytopes that do have unimodular…

$ $Abert, Gelander and Nikolov [AGN17] conjectured that the number of generators $d(\Gamma)$ of a lattice $\Gamma$ in a high rank simple Lie group $H$ grows sub-linearly with $v = \mu(H / \Gamma)$, the co-volume of $\Gamma$ in $H$. We prove…

群论 · 数学 2021-01-19 Alexander Lubotzky , Raz Slutsky

In this paper, we establish the explicit lower bound estimates for the rank of universal quadratic forms in some certain families of real cubic fields under the condition of density one. The more general results that represent all multiples…

数论 · 数学 2023-06-02 Liwen Gao , Xuejun Guo

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

组合数学 · 数学 2011-12-14 Joseph Gubeladze

We describe the local structure of Riemannian manifolds with harmonic curvature which admit a maximum number, in a well-defined sense, of local warped-product decompositions, and at the same time their Ricci tensor has, at some point, only…

微分几何 · 数学 2023-09-12 Andrzej Derdzinski , Paolo Piccione