Related papers: ST-Distributive and ST-Modular Lattices
Let $\mathcal{T}$ be a collection of 3-element subsets $S$ of $\{1, \ldots,n\}$ with the property that if $i<j<k$ and $a<b<c$ are two 3-element subsets in $S$, then there exists an integer sequence $x_1 < x_2 < \cdots < x_n$ such that $x_i,…
We continue our investigation of paraorthomodular BZ*-lattices (PBZ*-lattices), started in \cite{GLP1+,PBZ2,rgcmfp,pbzsums,pbz5}. We shed further light on the structure of the subvariety lattice of the variety $\mathbb{PBZL}^{\ast }$ of…
Let L_1 and L_2 be complete atomistic lattices. In a previous paper, we have defined a set S=S(L_1,L_2) of complete atomistic lattices, the elements of which are called weak tensor products of L_1 and L_2. S is defined by means of three…
Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…
A partial lattice P is ideal-projective, with respect to a class C of lattices, if for every K $\in$ C and every homomorphism $\phi$ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f : P…
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…
The purpose of this article is to investigate the combinatorial properties of the cross section lattice of a $J$-irreducible monoid associated with a semisimple algebraic group of one of the types $A_n$, $B_n$, or $C_n$. Our main tool is a…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
We survey results concerning special elements of nine types (modular, lower-modular, upper-modular, cancellable, distributive, codistributive, standard, costandard and neutral elements) in the lattice of all semigroup varieties and certain…
Let L be a join-distributive lattice with length n and width(Ji L) \leq k. There are two ways to describe L by k-1 permutations acting on an n-element set: a combinatorial way given by P.H. Edelman and R.E. Jamison in 1985 and a recent…
The ordering relation of a bounded distributive lattice L is a (distributive) (0, 1)-sublattice of L \times L. This construction gives rise to a functor \Phi from the category of bounded distributive lattices to itself. We examine the…
If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…
We analyse various structural and order-theoretical aspects of abstract separation systems and partial lattices, as well as the relationship between the different submodularity conditions one can impose on them.
In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…
We show that the congruence lattice of a semilattice satsifies a form of distributivity relative to principal congruences of the form $ \Theta_{t \odot s, s}$. Particularly, we establish that semilattice congruences obey the ``pairwise…
Slim semimodular lattices were introduced by G. Gr\"atzer and E. Knapp in 2007, and they have intensively been studied since then. It is often reasonable to give these lattices by their $\mathcal C_1$-diagrams defined by the author in 2017.…
Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…
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…
We give two sufficient conditions for the lattice Co(R^n,X) of relatively convex sets of n-dimensional real space R^n to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice…