Related papers: Finite Dismantlable Semidistributive Lattices are …

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…

This article is part of my upcoming masters thesis which investigates the following open problem from the book, Free Lattices, by R.Freese, J.Jezek, and J.B. Nation published in 1995: "Which lattices (and in particular which countable…

We characterize the finite intervals of the Muchnik lattice by proving that they are a certain proper subclass of the finite distributive lattices.

It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The…

Let S be a distributive {∨, 0}-semilattice. In a previous paper, the second author proved the following result: Suppose that S is a lattice. Let K be a lattice, let $\phi$: Con K $\to$ S be a {∨, 0}-homomorphism. Then $\phi$ is,…

Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…

For a finite distributive lattice $D$, let us call $Q \subseteq D$ \emph{principal congruence representable}, if there is a finite lattice $L$ such that the congruence lattice of $L$ is isomorphic to $D$ and the principal congruences of $L$…

The propagator is calculated on a noncommutative version of the flat plane and the Lobachevsky plane with and without an extra (euclidean) time parameter. In agreement with the general idea of noncommutative geometry it is found that the…

We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and let $\phi$: Con K $\to$ D be a {∨, 0}-homomorphism, where Conc K denotes the {∨, 0}-semilattice of all finitely generated…

We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…

By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a…

Let $S$ be a multiplicatively idempotent congruence-simple semiring. We show that $|S|=2$ if $S$ has a multiplicatively absorbing element. We also prove that if $S$ is finite then either $|S|=2$ or $S\cong End(L)$ or $S^{op}\cong End(L)$…

A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…

In a 1998 paper with H. Lakser, the authors proved that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite \emph{semimodular lattice}. Some ten years later, the first author and E. Knapp proved a…

For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…

A subset $X$ of a finite lattice $L$ is CD-independent if the meet of any two incomparable elements of $X$ equals 0. In 2009, Cz\'edli, Hartmann and Schmidt proved that any two maximal CD-independent subsets of a finite distributive lattice…

We characterize when a finite lattice is distributive by the existences of some particular classes of Koszul filtrations.

Divisible residuated lattices are algebraic structures corresponding to a more comprehensive logic than Hajek's basic logic with an important significance in the study of fuzzy logic. The purpose of this paper is to investigate commutative…

We completely determine all semigroup varieties satysfiyng a permutational identity of length 3 that are modular elements of the lattice of all semigroup varieties. Using this result, we provide an example of a semigroup variety that is a…

We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…