English
Related papers

Related papers: An Identity of Distributive Lattices

200 papers

We prove a Fundamental Theorem of Finite Semidistributive Lattices (FTFSDL), modelled on Birkhoff's Fundamental Theorem of Finite Distributive Lattices. Our FTFSDL is of the form "A poset L is a finite semidistributive lattice if and only…

Combinatorics · Mathematics 2026-05-13 Nathan Reading , David E Speyer , Hugh Thomas

We investigate whether the set of subfit elements of a distributive semilattice is an ideal. This question was raised by the second author at the BLAST conference in 2022. We show that in general it has a negative solution, however if the…

General Topology · Mathematics 2025-03-26 Guram Bezhanishvili , James Madden , M. Andrew Moshier , Marcus Tressl , Joanne Walters-Wayland

We present an algorithmic approach to the verification of identities on multiple theta functions in the form of products of theta functions $[(-1)^{\delta}a_1^{\alpha_1}a_2^{\alpha_2}\cdots a_r^{\alpha_r}q^{s}; q^{t}]_\infty$, where…

Classical Analysis and ODEs · Mathematics 2017-07-11 William Y. C. Chen , Lisa H. Sun

A new realization of the conformal algebra is studied which mimics the behaviour of a statistical system on a discrete albeit infinite lattice. The two-point function is found from the requirement that it transforms covariantly under this…

Statistical Mechanics · Physics 2008-11-26 Malte Henkel , Dragi Karevski

Associated with any composition beta=(a,b,...) is a corresponding fence poset F(beta) whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... The distributive lattice L(beta) of all lower order…

Combinatorics · Mathematics 2022-01-11 Sergi Elizalde , Bruce Sagan

We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…

Discrete Mathematics · Computer Science 2013-09-12 Francesco Marigo

As follows from the Schwartz Impossibility Theorem, multiplication of two distributions is in general impossible. Nevertheless, often one needs to multiply a distribution by a discontinuous function, not by an arbitrary distribution. In the…

Classical Analysis and ODEs · Mathematics 2007-05-23 V. Derr , D. Kinzebulatov

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.…

Logic in Computer Science · Computer Science 2018-07-23 Kevin H. Knuth

We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that…

Combinatorics · Mathematics 2009-02-03 Colin Bailey , Joseph Oliveira

Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…

Combinatorics · Mathematics 2026-03-17 Dale R. Worley

${\cal E}$ denotes the family of all finite nonempty $S\subseteq{\mathbb N}:=\{1,2,\ldots\}$, and ${\cal E}(X):={\cal E}\cap\{S:S\subseteq X\}$ when $X\subseteq{\mathbb N}$. Similarly, ${\cal F}$ denotes the family of all finite nonempty…

Number Theory · Mathematics 2019-02-20 Donald Silberger , Sylvia Silberger , David Hobby

Let L be a complete lattice and let Q(L) be the unital quantale of join-continuous endo-functions of L. We prove the following result: Q(L) is an involutive (that is, non-commutative cyclic $\star$-autonomous) quantale if and only if L is a…

Logic in Computer Science · Computer Science 2020-04-20 Luigi Santocanale

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

Rings and Algebras · Mathematics 2012-02-20 Miguel Couceiro , Jean-Luc Marichal

In this paper, a subclass of bounded distributive lattices, that is, finitely disjunctive distributive lattices (FDD-lattices) have been introduced. Then we apply it to establish a Stone duality for Lawson compact algebraic L-domains.…

General Topology · Mathematics 2026-02-16 Huijun Hou , Ao Shen

We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…

Rings and Algebras · Mathematics 2026-02-10 Jun Jiao , Miaomiao Ren

We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.

Rings and Algebras · Mathematics 2019-08-13 G. Grätzer , E. T. Schmidt

In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…

Rings and Algebras · Mathematics 2017-06-22 G. Grätzer , H. Lakser

We develop a new duality for distributive and implicative meet semi-lattices. For distributive meet semi-lattices our duality generalizes Priestley's duality for distributive lattices and provides an improvement of Celani's duality. Our…

Logic · Mathematics 2024-11-01 Guram Bezhanishvili , Ramon Jansana

The aim of this paper is to study the class of quasicomplemented distributive nearlattices. We investigate $\alpha$-filters and $\alpha$-ideals in quasicomplemented distributive nearlattices and some results on ideals-congruence-kernels.…

Logic · Mathematics 2025-04-03 Ismael Calomino

We prove a central limit theorem for the joint distribution of $s_q(A_jn)$, $1\le j \le d$, where $s_q$ denotes the sum-of-digits function in base~$q$ and the $A_j$'s are positive integers relatively prime to $q$. We do this in fact within…

Number Theory · Mathematics 2019-08-16 Michael Drmota , Christian Krattenthaler