Related papers: Lattice initial segments of the hyperdegrees

We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…

We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…

The paper studies the lattice of subgroups of an isotropic reductive group G(R) over a commutative ring R, normalized by the elementary subgroup E(R). We prove the sandwich classification theorem for this lattice under the assumptions that…

Divergence functions of a metric space estimate the length of a path connecting two points $A$, $B$ at distance $\le n$ avoiding a large enough ball around a third point $C$. We characterize groups with non-linear divergence functions as…

We develop a representation theory for $\lambda$-lattices, arising as standard invariants of subfactors, and for rigid C*-tensor categories, including a definition of their universal C*-algebra. We use this to give a systematic account of…

Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18.…

The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are themeet and join operations in a class of lattices, known by now as the relational lattices. They…

In 2002 Thakare et al.\ counted non-isomorphic lattices on $n$ elements, having nullity up to two. In 2020 Bhavale and Waphare introduced the concept of RC-lattices as the class of all lattices in which all the reducible elements are…

We establish several independent results concerning extremal, left modular, congruence uniform, and semidistributive lattices. An equivalent characterization of left modular lattices is obtained in terms of edge-labellings, together with…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.

Our earlier article proved that if $n > 1$ translates of sublattices of $Z^d$ tile $Z^d$, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. We re-prove this…

We investigate an integrable property and observables of 2 dimensional N=(4,4) topological field theory defined on a discrete lattice by using the "orbifolding" and "deconstruction" methods. We show that our lattice model possesses the…

Let $\Gamma$ be a finitely generated cocompact lattice of a totally disconnected locally compact group $G$, and $C$ a dense subgroup of $G$ that contains and commensurates $\Gamma$. We study the problem of describing all finitely generated…

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

We consider the role of the diffeomorphism constraint in the quantization of lattice formulations of diffeomorphism invariant theories of connections. It has been argued that in working with abstract lattices, one automatically takes care…

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…