Related papers: On Perfection Relations in Lattices
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…
Let $L$ be a lattice of full rank in $n$-dimensional real space. A vector in $L$ is called $i$-sparse if it has no more than $i$ nonzero coordinates. We define the $i$-th successive sparsity level of $L$, $s_i(L)$, to be the minimal $s$ so…
We find sharp absolute constants $C_1$ and $C_2$ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
Approximate lattices are aperiodic generalisations of lattices of locally compact groups that were first studied in seminal work of Yves Meyer. They are defined as those uniformly discrete approximate subgroups (symmetric subsets stable…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
Let $\Lb$ be a lattice in an $n$-dimensional Euclidean space $E$ and let $\Lb'$ be a Minkowskian sublattice of $\Lb$, that is, a sublattice having a basis made of representatives for the Minkowski successive minima of $\Lb$. We consider the…
An orthogonality space is a set equipped with a symmetric, irreflexive relation called orthogonality. Every orthogonality space has an associated complete ortholattice, called the logic of the orthogonality space. To every poset, we…
A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…
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…
We consider the continued fraction expansion of real numbers under the action of a non-uniform lattice in PSL(2,R) and prove metric relations between the convergents and a natural geometric notion of good approximations.
The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…
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…
A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…
We study $b$-property of a sublattice (or an order ideal) $F$ of a vector lattice $E$. In particular, $b$-property of $E$ in $E^\delta$, the Dedekind completion of $E$, $b$-property of $E$ in $E^u$, the universal completion of $E$, and…
Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In…
This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…
In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…
We study effectively inseparable (e.i.) pre-lattices (i.e. structures of the form $L=\langle \omega, \wedge, \lor, 0, 1, \leq_L\rangle$ where $\omega$ denotes the set of natural numbers and the following hold: $\wedge, \lor$ are binary…
Given a lattice $\Lambda \subset \mathbb{R}^n$, we consider its Minkowski reduced basis and the solid angle $\Omega$ spanned by the basis vectors. Such a basis satisfies strong near-orthogonality conditions, which allow us to bound from…