Related papers: Retracts of rectangular distributive lattices and …
A rotational lattice is a structure (L;\vee,\wedge, g) where L=(L;\vee,\wedge) is a lattice and g is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using J\'onsson's lemma,…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…
For two subsets S and T of a given lattice L, we define a relative distributive (modular) property over L, that underlies a large family including the usual class of distributive (modular) lattices. Our proposed class will be called…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
It is known that every relatively pseudocomplemented lattice is residuated and, moreover, it is distributive. Unfortunately, non-distributive lattices with a unary operation satisfying properties similar to relative pseudocomplementation…
We describe the absolute retracts for the following classes of finite lattices: (1) slim semimodular lattices, (2) finite distributive lattices, and for each positive integer $n$, (3) at most $n$-dimensional finite distributive lattices.…
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…
We produce an example of an irreducible discrete subgroup in the product $SL(2,\R)\times SL(2,\R)$ which is not a lattice. This answers a question asked in [15].
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…
For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…
In 1986, Oliver Pretzel studied the set of orientations of a connected finite graph $G$ and showed that any two such orientations having the same flow-difference around all closed loops can be obtained from one another by a succession of…
Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute $\reg R(L)$ when $L$ is a planar lattice and give a lower bound for $\reg R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a…
Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…
Let $L$ denote a finite lattice with at least two points and let $A$ denote the incidence algebra of $L$. We prove that $L$ is distributive if and only if $A$ is an Auslander regular ring, which gives a homological characterisation of…
In this paper we determine, under some mild restrictions, the lattice of submodules $\gL$ of a module $M$ all of whose composition factors have multiplicity one. Such a lattice is distributive, and hence determined by its poset of down-sets…