Related papers: Finite distributive nearlattices
The paper deals with a construction of a separating system of rational invariants for finite dimensional generic algebras. In the process of dealing an approach to a rough classification of finite dimensional algebras is offered by…
For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows:…
We obtain a duality between certain category of finite MTL-algebras and the category of finite labeled trees. In addition we prove that certain poset products of MTL-algebras are essentialy sheaves of MTL-chains over Alexandrov spaces.…
In this study, we introduce the concept of quasi n-absorbing elements of multiplicative lattices. A proper element q is said to be a quasi n-absorbing element of L if whenever $a^nb\le q$ implies that either $a^n\le q$ or $a^{n-1}b\le q$.…
In representation theory of finite-dimensional algebras, (semi)bricks are a generalization of (semi)simple modules, and they have long been studied. The aim of this paper is to study semibricks from the point of view of $\tau$-tilting…
In this paper, we investigate the algebras of consequence operators and finite consequence operators on a fixed language. Significant new collections of consequence operators are defined and shown to be complete and distributive…
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…
Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…
Given a partially ordered set $P$ there exists the most general Boolean algebra $F(P)$ which contains $P$ as a generating set, called the {\it free Boolean algebra} over $P$. We study free Boolean algebras over posets of the form $P=P_0\cup…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
We investigate endomorphism semirings of a finite semilattice with one least element and one greatest element such that all the other elements form an antichain. We construct some new finite simple semirings. Keywords: endomorphism…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
For a certain class of finite posets, we prove that all their irreducible orthoscalar representations are finite-dimensional and describe those, for which there exist essential (non-degenerate) irreducible orthoscalar representations.
The aim of this paper is to present a very simple set of conditions, necessary for the management of knowledge of a poset $T$ of two agents, which are partially ordered by the capabilities available in the system. We build up a formal…
The aim of this article is to extend the notions of strongly hollow and completely strongly hollow ideals of commutative rings to multiplicative lattices. We investigate their basic structural properties and prove several characterizations…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
For an integer $n\geq 2$, let NCSL$(n)$ denote the set of sizes of congruence lattices of $n$-element semilattices. We find the four largest numbers belonging to NCSL$(n)$, provided that $n$ is large enough to ensure that $|$NCSL$(n)|\geq…