Related papers: Distributivity in skew lattices
A distributive lattice-ordered magma ($d\ell$-magma) $(A,\wedge,\vee,\cdot)$ is a distributive lattice with a binary operation $\cdot$ that preserves joins in both arguments, and when $\cdot$ is associative then $(A,\vee,\cdot)$ is an…
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…
This paper provides a fresh perspective on the representation of distributive bilattices and of related varieties. The techniques of naturalduality are employed to give, economically and in a uniform way, categories ofstructures dually…
The theory of bounded, distributive lattices provides the appropriate language for describing directionality and asymptotics in dynamical systems. For bounded, distributive lattices the general notion of `set-difference' taking values in a…
Related to his S-glued sum construction, the skeleton S(L) of a finite lattice L was introduced by C. Herrmann in 1973. Our theorem asserts that if D is a finite distributive lattice and its second skeleton, S(S(D)), is the trivial lattice,…
The main objective of this paper is to study the relationship between a solvable evolution algebra and its subalgebra lattice, emphasizing two of its main properties: distributivity and modularity. First, we will focus on the nilpotent…
Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…
We characterize when a finite lattice is distributive by the existences of some particular classes of Koszul filtrations.
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…
In residuated binars there are six non-obvious distributivity identities of $\cdot$,$/$,$\backslash$ over $\wedge, \vee$. We show that in residuated binars with distributive lattice reducts there are some dependencies among these…
Distributivity is a well-established and extensively studied notion in lattice theory. In the context of data analysis, particularly within Formal Concept Analysis (FCA), lattices are often observed to exhibit a high degree of…
We establish an identity for E f (Y) -E f (X), when X and Y both have matrix variateskew-normal distributions and the function f fulfills some weak conditions. Thecharacteristic function of matrix variate skew normal distribution is then…
This paper fills a gap in the literature on natural duality theory. It concerns dual representations of categories of distributive-lattice-based algebras in which the lattice reducts are not assumed to have bounds. The development of theory…
We investigate whether the set of subfit elements of a distributive semilattice is an ideal. This question was raised by the second author at the BLAST conference in 2022. We show that in general it has a negative solution, however if the…
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…
For an ordered array of critical volatile wetting droplets the formation of a super lattice by an Ostwald-ripening like competition process is considered. The underlying diffusion problem is treated within a quasistatic approximation and to…
Meet-distributive lattices form an intriguing class of lattices, because they are precisely the lattices obtainable from a closure operator with the so-called anti-exchange property. Moreover, meet-distributive lattices are join…
Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic.…
In prior work, the authors, along with M. McClard, R. A. Proctor, and N. J. Wildberger, studied certain distributive lattice models for the `Weyl bialternants' (aka `Weyl characters') associated with the rank two root systems/Weyl groups.…
In this paper subvarieties of pseudocomplemented distributive lattices are classified by their unification type. We determine the unification type of every particular unification problem in each subvariety of pseudocomplemented distributive…