Related papers: Formal Concepts and Residuation on Multilattices
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…
Relational lattice reduces the set of six classic relational algebra operators to two binary lattice operations: natural join and inner union. We give an introduction to this theory with emphasis on formal algebraic laws. New results…
In a previous work, (dual)-$\mathfrak{m}$-Rickart lattices were studied. Now, in this paper, we introduce $\mathfrak{m}$-endoregular lattices as those lattices $\mathcal{L}$ such that $\mathfrak{m}$ is a regular monoid, where $\mathfrak{m}$…
Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $\mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\mathsf{C}(L)$ of aggregation functions on $L$. The…
Diversities are a generalization of metric spaces, where instead of the non-negative function being defined on pairs of points, it is defined on arbitrary finite sets of points. Diversities have a well-developed theory. This includes the…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
We develop a relational duality for semilattices with adjunctions (SLatas) based on binary meet-relations. First, we introduce the category of MoS-spaces and establish a dual equivalence with modal semilattices. Then, by means of…
In this paper, we reveal some relations between fuzzy logic and quantum logic, and mainly study the partial residuated implications (PRIs) derived from partial triangular norms (partial t-norms) and partial residuated lattices (PRLs), and…
Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…
The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are themeet and join operations in a class of lattices, known by now as the relational lattices. They…
The join-meet ideal was introduced by Takayuki Hibi in 1987. It is binomial ideals that are defined by finite lattices. We study the join-meet ideal of non-distributive finite lattices that do not always satisfy modular. In particular, we…
In this paper, based on ideals, we investigate residuated lattices from fuzzy set theory and lattice theory point of view. Ideals are important concepts in the theory of algebraic structures used for formal fuzzy logic and first, we…
An empty simplex is a lattice simplex with only its vertices as lattice points. Their classification in dimension three was completed by White in 1964. In dimension four, the same task was started in 1988 by Mori, Morrison, and Morrison,…
A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…
The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…
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…
We prove that, under mild assumptions, a lattice in a product of semi-simple Lie group and a totally disconnected locally compact group is, in a certain sense, arithmetic. We do not assume the lattice to be finitely generated or the ambient…
As the main achievement of the paper, we construct a three-generated, 2-distributive, atomless lattice that is not finitely presented. Also, the paper contains the following three observations. First, every coatomless three-generated…