On Stanley-Reisner rings
We use graph-algebraic results proved in [8] and some results of the graph theory to characterize all pairs of lattices for which there is a finite partial unary algebra such that its weak and strong subalgebra lattices are isomorphic to and , respectively. Next, we describe other pairs of subalgebra lattices (weak and relative, etc.) of a finite unary algebra. Finally, necessary and sufficient conditions are found for quadruples of lattices for which there is a finite unary algebra having...
In the present note we characterize finite lattices which are isomorphic to the congruence lattice of an abelian lattice ordered group.
We consider the problem of constructing dense lattices in with a given non trivial automorphisms group. We exhibit a family of such lattices of density at least , which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions , we exhibit a finite set of lattices that come with an automorphisms group of size , and a constant proportion of which achieves the aforementioned lower bound on the largest packing density. The algorithmic...