相关论文: Distributive and lower-modular elements of the lat…

We study weaker variations of the property of flatness in matroid theory. We show that these variations form a chain of increasingly stronger properties all implying pseudomodularity on its lattice of flats. We show examples in the gammoid…

The concept of a $\lambda$-lattice was introduced by V. Sn\'a\v sel in order to generalize some lattice concepts for directed posets whose elements need not have suprema or infima. We extend the concept of semimodularity from lattices to…

It is shown that the numbers $c_i$ of chains of length $i$ in the proper part $L\setminus\{0,1\}$ of a distributive lattice $L$ of length $\ell +2$ satisfy the inequalities $$c_0<...<c_{\lfloor{\ell /2}\rfloor} \quad{and}\quad c_{\lfloor{3…

This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving…

Using the classification and description of the structure of bisimple monogenic orthodox semigroups obtained in \cite{key10}, we prove that every bisimple orthodox semigroup generated by a pair of mutually inverse elements of infinite order…

In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of…

In this paper, we study polynomial-like elements in vector spaces equipped with group actions. We first define these elements via iterated difference operators. In the case of a full rank lattice acting on an Euclidean space, these…

In a finite distributive lattice $\L$ we define two functions $s(\alpha)=|\{\delta \in \mathcal{L} | \delta \leq \alpha \}|$ and $l(\alpha)=|\{\delta \in \mathcal{L} | \delta \geq \alpha \}|$. In this present article we prove that the sum…

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show…

Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a class of semigroups is lattice closed if it contains every semigroup which is lattice isomorphic to some semigroup from that class. An…

Let $L$ be a lattice of finite length and let $d$ denote the minimum path length metric on the covering graph of $L$. For any $\xi=(x_1,\dots,x_k)\in L^k$, an element $y$ belonging to $L$ is called a median of $\xi$ if the sum…

In this paper we continue the study of the subalgebra lattice of a Leibniz algebra. In particular, we find out that solvable Leibniz algebras with an upper semi-modular lattice are either almost-abelian or have an abelian ideal spanned by…

In 2020 Bhavale and Waphare introduced the concept of a nullity of a poset as nullity of its cover graph. According to Bhavale and Waphare, if a dismantlable lattice of nullity k contains r reducible elements then 2 $\leq$ r $\leq$ 2k. In…

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.

In Finite Group Modular Representation Theory, the basic objects are the indecomposable and simple modules. This paper offers a new classification of these objects that refines the Green Theory Classification of indecomposable and simple…

In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the…