中文
相关论文

相关论文: Classification of eight dimensional perfect forms

200 篇论文

We study well-rounded ideal lattices from totally definite quaternion algebras. We prove existence and classification results, and illustrate our methods with examples.

环与代数 · 数学 2025-12-04 Yuan Xiang Chew , Frédérique Oggier

A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…

度量几何 · 数学 2007-05-23 Mathieu Dutour , Robert Erdahl , Konstantin Rybnikov

We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…

数论 · 数学 2012-04-10 Lenny Fukshansky , Kathleen Petersen

We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of…

数论 · 数学 2018-09-11 Markus Kirschmer , Gabriele Nebe

In this paper we describe an algorithm for classifying orbits of vectors in Lorentzian lattices. The main point of this is that isomorphism classes of positive definite lattices in some genus often correspond to orbits of vectors in some…

数论 · 数学 2007-05-23 R. E. Borcherds

We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…

统计力学 · 物理学 2009-11-13 Deepak Dhar , Samarth Chandra

The lattices $D_4$ and $E_8$ are known to be the densest lattices in dimensions 4 and 8, respectively. In this paper, we employ tools from algebraic number theory to prove that the $D_4$-lattice arises from an infinite family of totally…

数论 · 数学 2025-09-08 L. F. Santos , G. C. Jorge

We review a lattice construction arising from quaternion algebras over number fields and use it to obtain some known extremal and densest lattices in dimensions 8 and 16. The benefit of using quaternion algebras over number fields is that…

数论 · 数学 2021-09-27 Laia Amorós , M. Taoufiq Damir , Camilla Hollanti

We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…

离散数学 · 计算机科学 2013-09-12 Francesco Marigo

We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…

组合数学 · 数学 2025-10-13 Marie-Charlotte Brandenburg , Chiara Meroni

We classify the dual strongly perfect lattices in dimension 16. There are four pairs of such lattices, the famous Barnes-Wall lattice $\Lambda _{16}$, the extremal 5-modular lattice $N_{16}$, the odd Barnes-Wall lattice $O_{16}$ and its…

数论 · 数学 2021-11-15 Sihuang Hu , Gabriele Nebe

A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…

数论 · 数学 2011-10-20 Achill Schuermann

It is shown that the Coxeter-Todd lattice is the unique strongly perfect lattice in dimension 12.

数论 · 数学 2007-05-23 Gabriele Nebe , Boris Venkov

We propose an algebraic and a geometric classification of euclidean isodual lattices of fixed rank. First, we prove that these lattices are distribued according to a finite number of algebraic types. Second, we show that they are…

数论 · 数学 2014-11-11 Christophe Bavard

A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the…

数论 · 数学 2016-11-17 Mathieu Dutour , Konstantin Rybnikov

In 1908, Voronoi introduced an algorithm that solves the lattice packing problem in any dimension in finite time. Voronoi showed that any lattice with optimal packing density must be a so-called perfect lattice, and his algorithm enumerates…

数论 · 数学 2026-02-10 Mathieu Dutour Sikirić , Wessel van Woerden

A periodic lattice in Euclidean 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-03-29 Vitaliy Kurlin

This is a complete classification of the complex forms of quaternionic symmetric spaces

微分几何 · 数学 2007-05-23 Joseph A. Wolf

We give a classification of the lattices of rank r=4, r=8 and r=12 over \Q(\sqrt{-3}), which are even and unimodular \Z-lattices. Using this classification we construct the associated theta series, which are Hermitian modular forms, and…

数论 · 数学 2009-03-26 Michael Hentschel , Aloys Krieg , Gabriele Nebe

We show that the number $p\_d$ of non-similar perfect $d$-dimensional lattices satisfies eventually the inequalities$e^{d^{1-\epsilon}}<p\_d<e^{d^{3+\epsilon}}$ for arbitrary smallstrictly positive $\epsilon$.

数论 · 数学 2017-08-31 Roland Bacher
‹ 上一页 1 2 3 10 下一页 ›