Related papers: On well-rounded ideal lattices
A lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the $L^2$ norm all lattices of dimension $n$ are standard if…
We study the relationships among existing results about representations of distributive semilattices by ideals in dimension groups, von Neumann regular rings, C*-algebras, and complemented modular lattices. We prove additional…
A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…
A polytope $D$ whose vertices belong to a lattice of rank $d$ is Delaunay if there is a circumscribing $d$-dimensional ellipsoid, $E$, with interior free of lattice points so that the vertices of $D$ lie on $E$. If in addition, the…
Lenstra introduced the notion of the Euclidean ideal class, a generalization of the Euclidean domain that captures cyclic class groups. In this article, we establish the existence of Euclidean ideal classes in abelian quartic fields. As a…
Faithful representations of regular $\ast$-rings and modular complemented lattices with involution within orthosymmetric sesquilinear spaces are studied within the framework of Universal Algebra. In particular, the correspondence between…
Reduced ideals have been defined in the context of integer rings in quadratic number fields, and they are closely tied to the continued fraction algorithm. The notion of this type of ideal extends naturally to number fields of higher…
A marked lattice is a $d$-dimensional Euclidean lattice, where each lattice point is assigned a mark via a given random field on ${\mathbb Z}^d$. We prove that, if the field is strongly mixing with a faster-than-logarithmic rate, then for…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
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…
In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible.
In this paper we explore which part of the ideal lattice of a general ring is parametrized by its Cuntz semigroup $\mathrm{S}(R)$ and its ambient semigroup $\Lambda(R)$. We identify these classes of ideals as the quasipure ideals (a…
For $n=3$, 4, and 5, we prove that, when $S_n$-number fields of degree $n$ are ordered by their absolute discriminants, the lattice shapes of the rings of integers in these fields become equidistributed in the space of lattices.
The maximal index of a Euclidean lattice L of dimension n is the maximal index of the sub-lattices of L spanned by n independent minimal vectors of L. In this paper, we prove that a perfect lattice of maximal index two not provided by a…
In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…
We find explicit formulas for the radii and locations of the circles in all the optimally dense packings of two, three or four equal circles on any flat torus, defined to be the quotient of the Euclidean plane by the lattice generated by…
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…
We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…
Given a square-free monomial ideal $I$ in a polynomial ring $R$ over a field $\mathbb{K}$, one can associate it with its LCM-lattice and its hypergraph. In this short note, we establish the connection between the LCM-lattice and the…
Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…