Related papers: Simultaneous representations of semilattices by la…
Each quiver corresponds to a path semigroup, and such a path semigroup also corresponds to an associative K-algebra over an algebraically closed field K. Let Q be a quiver and S_Q, KQ be its path semigroup, path algebra, respectively. In…
By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…
We study quasi-isometric embeddings of symmetric spaces and non-uniform irreducible lattices in semisimple higher rank Lie groups. We show that any quasi-isometric embedding between symmetric spaces of the same rank can be decomposed into a…
We study compatible aggregation functions on a general bounded distributive lattice $L$, where the compatibility is related to the congruences on $L$. As a by-product, a new proof of an earlier result of G. Gr\"atzer is obtained. Moreover,…
In his seminal paper that inaugurated abstract argumentation, Dung proved that the set of complete extensions forms a complete semilattice with respect to set inclusion. In this note we demonstrate that this proof is incorrect with…
Let $K \subseteq \mathbb{R}^{2 \times 2}$ be a compact set, let $K^{rc}$ be its rank-one convex hull, and let $L(K)$ be its lamination convex hull. It is shown that the mapping $K \to \overline{L(K)}$ is not upper semicontinuous on the…
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
We study the pointed lattice subreducts of varieties of residuated lattices (RLs) and commutative residuated lattices (CRLs), i.e. lattice subreducts expanded by the constant 1 denoting the multiplicative unit. Given any positive universal…
The concept of a sectionally pseudocomplemented lattice was introduced by I. Chajda as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular…
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…
We prove that the excedance relation on permutations defined by N. Bergeron and L. Gagnon actually extends to a congruence of the lattice on alternating sign matrices. Motivated by this example, we study all lattice congruences of the…
A modular semilattice is a semilattice generalization of a modular lattice. We establish a Birkhoff-type representation theorem for modular semilattices, which says that every modular semilattice is isomorphic to the family of ideals in a…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
On an arbitrary meet-semilattice S with 0 we define an orthogonality relation and investigate the lattice Cl(S) of all subsets of S closed under this orthogonality. We show that if S is atomic then Cl(S) is a complete atomic Boolean…
The Gr\"atzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomorphic to the congruence lattice of an algebra. We study the reverse mathematics of this theorem. We also show that the set of indices of computable…
The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…
For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, --The class of all finite…
We study the congruence lattices of the multinomial lattices L(v) introduced by Bennett and Birkhoff. Our main motivation is to investigate Parikh equivalence relations that model concurrent computation. We accomplish this goal by providing…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…