Related papers: On lattices of maximal index two
Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…
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…
A discrete set in the Euclidian space is almost periodic, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We prove the following result: if A is a discrete almost periodic set and the set A-A…
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…
This is the second in a sequence of three papers investigating the question for which positive integers $m$ there exists a maximal antichain of size $m$ in the Boolean lattice $B_n$ (the power set of $[n]:=\{1,2,\dots,n\}$, ordered by…
For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…
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…
We classify maximal digraphs whose Hermitian spectral radius is at most $2$.
In this short note, we prove that the degree-three dilation of the square lattice $\mathbb{Z}^2$ is $1+\sqrt{2}$. This disproves a conjecture of Dumitrescu and Ghosh. We give a computer-assisted proof of a local-global property for the…
Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected…
A positive definite Hermitian lattice is said to be 2-universal if it represents all positive definite binary Hermitian lattices. We find all 2-universal ternary and quaternary Hermitian lattices over imaginary quadratic number fields.
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive…
We study the lattice of T-spaces of a free associative k-algebra over a nonempty set. It is shown that when the field k is infinite, then the lattice has a maximum element, and that maximum element is in fact a T-ideal. In striking…
Let $X$ be a minimal projective 3-fold of general type. The pluricanonical section index $\delta(X)$ is defined to be the minimal integer $m$ so that $P_{m}(X)\geq 2$. According to Chen-Chen, one has either $1\leq \delta(X)\leq 15$ or…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
In this paper, we discuss maximality of Seidel matrices with a fixed largest eigenvalue. We present a classification of maximal Seidel matrices of largest eigenvalue $3$, which gives a classification of maximal equiangular lines in a…
It is shown that an n-dimensional unimodular lattice has minimal norm at most 2[n/24] +2, unless n = 23 when the bound must be increased by 1. This result was previously known only for even unimodular lattices. Quebbemann had extended the…
Let $L$ be an $n$-element finite lattice. We prove that if $L$ has strictly more than $2^{n-5}$ congruences, then $L$ is planar. This result is sharp, since for each natural number $n\geq 8$, there exists a non-planar lattice with exactly…
We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…
A subset of vertices in a graph $G$ is considered a maximal dissociation set if it induces a subgraph with vertex degree at most 1 and it is not contained within any other dissociation sets. In this paper, it is shown that for $n\geq 3$,…