Related papers: Relatively residuated lattices and posets
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
We prove that every integral rig in Sets is (functorially) the rig of global sections of a sheaf of really local integral rigs. We also show that this representation result may be lifted to residuated integral rigs and then restricted to…
Following [Botur, M., Chajda, I., Hala\v{s}, R.: Are basic algebras residuated structures?, Soft Comput. 14 (2010), 251-255] we discuss the connections between left-residuated partially ordered groupoids and the so-called basic algebras,…
A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…
In this article we prove that the co-compactness of the arithmetic lattices in a connected semisimple real Lie group is preserved if the lattices under consideration are representation equivalent. This is in the spirit of the question posed…
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…
This paper explores the concept of \'{e}tal\'{e} spaces associated with residuated lattices. Notions of bundles and \'{e}tal\'{e}s of residuated lattices over a given topological space are introduced and investigated. For a topological…
Let $G$ be a real Lie group and $\Gamma < G$ be a discrete subgroup of $G$. Is $\Gamma$ residually finite? This paper describes known positive and negative results then poses some questions whose answers will lead to a fairly complete…
Distributivity is a well-established and extensively studied notion in lattice theory. In the context of data analysis, particularly within Formal Concept Analysis (FCA), lattices are often observed to exhibit a high degree of…
Sponges were recently proposed as a generalization of lattices, focussing on joins/meets of sets, while letting go of associativity/transitivity. In this work we provide tools for characterizing and constructing sponges on metric spaces and…
This article is the second part of an essay dedicated to lattices freely generated by posets within a variety. The first part dealt with four easy varieties while this part is concerned with finitely generated varieties. Here we present a…
We define and study "semimatroids", a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We show that geometric semilattices are precisely the posets of flats of semimatroids. We define and…
Skew lattices are non-commutative generalizations of lattices, and the cosets represent the building blocks that skew lattices are built of. As by Leech's Second Decomposition Theorem any skew lattice embeds into a direct product of a…
Let $m$ and $n$ be cardinals with $3\leq m,n\leq\omega$. We show that the class of posets that can be embedded into a distributive lattice via a map preserving all existing meets and joins with cardinalities strictly less than $m$ and $n$…
Two kinds of the connective implication are introduced as term operations of a pseudocomplemented lattice. It is shown that they share a lot of properties with the intuitionistic implication based on Heyting algebras. In particular, if the…
Perfect lattice actions are exiting with several respects: they provide new insight into conceptual questions of the lattice regularization, and quasi-perfect actions could enable a great leap forward in the non-perturbative solution of…
We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…
Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of the present paper in order to establish a useful tool for studying the logic of quantum mechanics. They investigated structural…