Related papers: Note on antichain cutsets in discrete semimodular …
In this paper we define the Boolean Lifting Property (BLP) for residuated lattices to be the property that all Boolean elements can be lifted modulo every filter, and study residuated lattices with BLP. Boolean algebras, chains, local and…
We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…
We characterize those semilattices that give rise to Boolean spaces on their associated spaces of ultrafilters. The class of 0-disjunctive semilattices, important in the theory of congruence-free inverse semigroups, plays a distinguished…
In this paper we completely characterize lattice ideals that are complete intersections or equivalently complete intersections finitely generated semigroups of $\bz^n\oplus T$ with no invertible elements, where $T$ is a finite abelian…
We demonstrate that an array of discrete waveguides on a slab substrate, both featuring the $\chi^{2}$ nonlinearity, supports stable solitons composed of discrete and continuous components. Two classes of fundamental composite solitons are…
We completely determine all semigroup [epigroup] varieties that are cancellable elements of the lattice of all semigroup [respectively epigroup] varieties.
We characterize when a finite lattice is distributive by the existences of some particular classes of Koszul filtrations.
Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of…
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
In this note we study the finite groups whose subgroup lattices are dismantlable.
We establish one-to-one correspondences between maximal antichains in products of two finite linear orders and other mathematical objects, such as certain alignments of two strings, walks on a grid, lattice paths, words of two or three…
Congruences on a graph inverse semigroup were recently described in terms of the underline graph. Based on such descriptions, we show that the lattice of congruences on a graph inverse semigroup is upper semimodular but not lower…
This paper primarily studies monomial ideals by their associated lcm-lattices. It first introduces notions of weak coordinatizations of finite atomic lattices which have weaker hypotheses than coordinatizations and shows the…
This is a survey of characterizations and relationships between some properties of lattices, particularly the modular, Arguesian, linear, and distributive properties, but also some other related properties. The survey emphasizes finite and…
A quasiantichain is a lattice consisting of a maximum, a minimum, and the atoms of the lattice. The width of a quasiantichian is the number of atoms. For a positive integer $w$ ($\ge 3$), a quasiantichain of width $w$ is denoted by…
In this paper we use a formal discrete-to-continuum procedure to derive a continuum variational model for two chains of atoms with slightly incommensurate lattices. The chains represent a cross-section of a three-dimensional system…
A recent result of G. Cz\'edli and E.\,T. Schmidt gives a construction of slim (planar) semimodular lattices from planar distributive lattices by adding elements, adding "forks". We give a construction that accomplishes the same by deleting…
We prove that the bounded derived category of the lattice of order ideals of the product of two ordered chains is fractionally Calabi-Yau. We also show that these lattices are derived equivalent to higher Auslander algebras of type A. The…
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.
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…