Related papers: Complemented lattices of subracks

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 abelian length categories, a generalization of module categories over Artin algebras. Let $\mathcal{A}$ be an abelian length category of colocal type. We show that the lattice $\mathsf{S}(\mathcal{A})$ of full additive subobject…

We study how the existence in an algebraic lattice $L$ of a chain of a given type is reflected in the join-semilattice $K(L)$ of its compact elements. We show that for every chain $\alpha$ of size $\kappa$, there is a set $\B$ of at most…

We investigate categorical and amalgamation properties of the functor Idc assigning to every partially ordered abelian group G its semilattice of compact ideals Idc G. Our main result is the following. Theorem 1. Every diagram of finite…

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 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…

We prove structural theorems for computing the completion of a G-spectrum at the augmentation ideal of the Burnside ring of a finite group G. First we show that a G-spectrum can be replaced by a spectrum obtained by allowing only isotropy…

We show that the commutator subgroup G' of a classical knot group G need not have subgroups of every finite index, but it will if G' has a surjective homomorphism to the integers and we give an exact criterion for that to happen. We also…

We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.

M.S. Rao recently investigated some sorts of special filters in distributive pseudocomplemented lattices. In our paper we extend this study to lattices which need neither be distributive nor pseudocomplemented. For this sake we define a…

We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…

A multiple group rack is a rack which is a disjoint union of groups equipped with a binary operation satisfying some conditions. It is used to define invariants of spatial surfaces, i.e., oriented compact surfaces with boundaries embedded…

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

An FN lattice $F$ is a simple, infinite, semidistributive lattice. Its existence was recently proved by R. Freese and J.\,B. Nation. Let $\mathsf{B}_n$ denote the Boolean lattice with $n$ atoms. For a lattice $K$, let $K^+$ denote $K$ with…

We study the finite basis problem for additively idempotent semirings satisfying the identity $xy \approx xz$. Let $\mathbf{R}$ denote the variety of all such semirings. Yue et al. (2025, Algebra Universalis, DOI:10.1007/s00012-025-00908-5)…

We introduce ($\ell$-)bimonoids as ordered algebras consisting of two compatible monoidal structures on a partially ordered (lattice-ordered) set. Bimonoids form an appropriate framework for the study of a general notion of complementation,…

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

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…

We investigate the extensions of the Hecke algebras of finite (complex) reflection groups by lattices of reflection subgroups that we introduced, for some of them, in our previous work on the Yokonuma-Hecke algebras and their connections…

Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…