Related papers: Distributivity in skew lattices
Let $A$ be a basic finite-dimensional algebra and denote by $\operatorname{tors} A$ the collection of all all torsion classes of $A$. It has been proved in \cite{Demonet} that $\operatorname{tors} A$ is always a completely semidistributive…
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…
In this paper we study the poset of basic tilting $kQ$-modules when $Q$ is a Dynkin quiver, and the poset of basic support $\tau$-tilting $kQ$-modules when $Q$ is a connected acyclic quiver respectively. It is shown that the first poset is…
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…
The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…
The family of skew-symmetric distributions is a wide set of probability density functions obtained by combining in a suitable form a few components which are selectable quite freely provided some simple requirements are satisfied. Intense…
It has long been known in universal algebra that any distributive sublattice of congruences of an algebra which consists entirely of commuting congruences yields a sheaf representation of the algebra. In this paper we provide a…
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
We prove that a variety of Novikov algebras has a distributive lattice of subvarieties if and only if the lattice of its subvarieties defined by identities of degree three is distributive, thus answering, in the case of Novikov algebras, a…
A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
This is a survey of characterizations and relationships between some properties of lattices, particularly the modular, Arguesian, linear, and distributive properties, but also some other related properties. The survey emphasizes finite and…
We study algebras encoding stable range branching rules for the pairs of complex classical groups of the same type in the context of toric degenerations of spherical varieties. By lifting affine semigroup algebras constructed from…
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…
Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem of of distributive bounded lattices expanded by modalities (functions distributing over joins) as the continuous sections of sheaves. Our…
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 article we investigate the relations between three classes of lattices each extending the class of distributive lattices in a different way. In particular, we consider join-semidistributive, join-extremal and left-modular lattices,…
We construct a completely normal bounded distributive lattice D in which for every pair (a, b) of elements, the set {x $\in$ D | a $\le$ b $\lor$ x} has a countable coinitial subset, such that D does not carry any binary operation -…
A D-polyhedron is a polyhedron $P$ such that if $x,y$ are in $P$ then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full…
Two concepts of symmetry for the distributions of positive random variables $Y$ are log-symmetry (symmetry of the distribution of $\log Y$) and R-symmetry [7]. In this paper, we characterise the distributions that have both properties,…