Related papers: Lattices and Their Consistent Quantification
We show that the algebraic aspects of Lie symmetries and generalized symmetries in nonrelativistic and relativistic quantum mechanics can be preserved in linear lattice theories. The mathematical tool for symmetry preserving discretizations…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
The Swing Lemma of the second author describes how a congruence spreads from a prime interval to another in a slim (having no $M_3$ sublattice), planar, semimodular lattice. We generalize the Swing Lemma to planar semimodular lattices.
We show that any first order ordinary differential equation with a known Lie point symmetry group can be discretized into a difference scheme with the same symmetry group. In general, the lattices are not regular ones, but must be adapted…
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…
Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related to measurement, not only in quantum logic,…
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…
We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a…
Several mathematical ideas have been investigated for Quantitative Information Flow. Information theory, probability, guessability are the main ideas in most proposals. They aim to quantify how much information is leaked, how likely is to…
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.
We characterize vector lattices in which unbounded order convergence is eventually order bounded. Among other things, the characterization provides a solution to \cite[Probl.23]{Az}.
The concept of a fuzzy number is generalized to the case of a finite carrier set of partially ordered elements, more precisely, a lattice, when a membership function also takes values in a partially ordered set (a lattice). Zadeh's…
The recently introduced consistent discrete lattice formulation of canonical general relativity produces a discrete theory that is constraint-free. This immediately allows to overcome several of the traditional obstacles posed by 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…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…
A full-rank lattice in the Euclidean space is a discrete set formed by all integer linear combinations of a basis. Given a probability distribution on $\mathbb{R}^n$, two operations can be induced by considering the quotient of the space by…
Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…
The problem of obtaining a realistic, relativistic description of a quantum system is discussed in the context of a simple (light-cone) lattice field theory. A natural stochastic model is proposed which, although non-local, is relativistic…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…