Related papers: A modular characterization of supersolvable lattic…
We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.
By working with coefficients in $\mathbb{Z}$ or $\mathbb{R}$, one can define two different notions of stability for a sandpile on a graph. We call a sandpile immutable when these notions agree. Our main results give linear-algebraic…
A residuated lattice is defined to be integrally closed if it satisfies the equations x\x = e and x/x = e. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded integrally closed…
We develop the theory of residuated lattices by introducing and studying several new types of filters and related concepts, including semi-simple filters, essential filters, the socle of a filter, and independent families of filters. Our…
Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important…
We show that every orthomodular lattice can be considered as a left residuated l-groupoid satisfying divisibility, antitony, the double negation law and three more additional conditions expressed in the language of residuated structures.…
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…
We characterize the pairs of sup-lattices which occur as pairs of Morita equivalence bimodules between quantales in terms of the mutual relation between the sup-lattices.
We classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is finite or satisfies the descending chain condition or satisfies the ascending chain condition. It turns out that for varieties in this…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in \cite{Kusa} actually characterize them. Secondly, by…
We characterize the order of principal congruences of a bounded lattice (also of a complete lattice and of a lattice of length 5) as a bounded ordered set. We also state a number of open problems in this new field.
Patch lattices, introduced by G. Cz\'edli and E.T. Schmidt in 2013, are the building stones for slim (and so necessarily finite and planar) semimodular lattices with respect to gluing. Slim semimodular lattices were introduced by G.…
We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.
We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
In a recent paper, G. Cz\'edli and E.\,T. Schmidt present a structure theorem for planar semimodular lattices. In this note, we present an alternative proof.
Given a lattice $\Lambda$ in a locally compact abelian group $G$ and a measurable subset $\Omega$ with finite and positive measure, then the set of characters associated to the dual lattice form a frame for $L^2(\Omega)$ if and only if the…
Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18.…
The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…