Related papers: Distributivity in skew lattices
For the distributions of finitely many binary random variables, we study the interaction of restrictions of the supports with conditional independence constraints. We prove a generalization of the Hammersley-Clifford theorem for…
The Swing Lemma of the second author describes how a congruence spreads from a prime interval to another in a slim (having no $M_3$ sublattice), planar, semimodular lattice. We generalize the Swing Lemma to planar semimodular lattices.
A fairly general procedure is studied to perturbate a multivariate density satisfying a weak form of multivariate symmetry, and to generate a whole set of non-symmetric densities. The approach is general enough to encompass a number of…
In this paper we give two characterisations of the class of reflexive graphs admitting distributive lattice polymorphisms and use these characterisations to address the problem of recognition: for a reflexive graph G in which no two…
Finite distributive lattices whose join-meet ideals are of K\"onig type will be classified. Furthermore, a class of polyominoes whose polyomino ideals are of K\"onig type will be studied.
We prove that the lattice of normal subgroups of ultraproducts of compact simple non-abelian groups is distributive. In the case of ultraproducts of finite simple groups or compact connected simple Lie groups of bounded rank the set of…
The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing the Hasse diagram is given, and the rank generating function…
A method for constructing distributions on the non negative integers as discrete analogue of continuous distributions on the non negative real is presented. A justification of the definition of discrete self decomposable laws is provided.…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
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…
Geometric lattices are characterized in this paper as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are…
Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…
A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
We note that each lattice $L$ has a unique largest distributive quotient, of which every distributive quotient of $L$ is itself a quotient.
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…
A distributive lattice with zero is completely normal if its prime ideals form a root system under set inclusion.Every such lattice admits a binary operation (x,y) \mapsto x-y satisfying the rules x \leq y\vee (x-y) and (x-y) \wedge (y-x)=0…
There are numerous generalizations of the celebrated Priestley duality for bounded distributive lattices to the non-distributive setting. The resulting dualities rely on an earlier foundational work of such authors as Nachbin,…
In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…
A rack is a set together with a self-distributive bijective binary operation. In this paper, we give a positive answer to a question due to Heckenberger, Shareshian and Welker. Indeed, we prove that the lattice of subracks of a rack is…
In this paper we introduce and study a variety of algebras that properly includes integral distributive commutative residuated lattices and weak Heyting algebras. Our main goal is to give a characterization of the principal congruences in…