Related papers: Yet Another Single Law for Lattices
Although quantum circuits have been ubiquitous for decades in quantum computing, the first complete equational theory for quantum circuits has only recently been introduced. Completeness guarantees that any true equation on quantum circuits…
We discuss two possible ways of representing tolerances: first, as a homomorphic image of some congruence; second, as the relational composition of some compatible relation with its converse. The second way is independent from the variety…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…
The conjecture that every modular lattice is integral is disproved.
This paper investigates the theory of lattices, focusing on extending lattices relative to abstract classes, modular lattices, and torsion lattices. Definitions of type-1 and type-2 extending lattices are provided, along with their weakly…
A simple condition is given that is sufficient to determine whether a measure that is absolutely continuous with respect to a Gau{\ss}ian measure on the space of distributions is reflection positive. It readily generalises conventional…
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of…
A rotational lattice is a structure (L;\vee,\wedge, g) where L=(L;\vee,\wedge) is a lattice and g is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using J\'onsson's lemma,…
We initiate the study of general metric lattices in the context of the model theory of metric structures. As an application we develop a theory of pseudo-finite limits of partition lattices and connect this theory with the theory of…
The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…
In this study, we introduce the concept of quasi n-absorbing elements of multiplicative lattices. A proper element q is said to be a quasi n-absorbing element of L if whenever $a^nb\le q$ implies that either $a^n\le q$ or $a^{n-1}b\le q$.…
In this paper, a new invariant was built towards the classification of separable C*-algebras of real rank zero, which we call latticed total K-theory. A classification theorem is given in terms of such an invariant for a large class of…
Quasi-lattices are introduced in terms of 'join' and 'meet' operations. It is observed that quasi-lattices become lattices when these operations are associative and when these operations satisfy 'modularity' conditions. A fundamental…
We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…
Optical absorption in a random one-dimensional lattice in the presence of paired correlated disorder is studied. The absorption line shape is evaluated by solving the microscopic equations of motion of the Frenkel-exciton problem in the…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
Given an arbitrary basis for a mathematical lattice, to find a ``good" basis for it is one of the classic and important algorithmic problems. In this note, we give a new and simpler proof of a theorem by Regavim (arXiv:2106.03183): we…
Although the characterization of ring derivations has an extensive literature, up to now, all of the characterizations have had the following form: additivity and another property imply that the function in question is a derivation. The aim…
A given question can be defined in terms of the set of statements or assertions that answer it. Application of logical inference to these sets of assertions allows one to derive the logic of inquiry among questions. There are interesting…