English
Related papers

Related papers: Zilber's Theorem for planar lattices, revisited

200 papers

In a 1998 paper with H. Lakser, the authors proved that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite \emph{semimodular lattice}. Some ten years later, the first author and E. Knapp proved a…

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

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

General Mathematics · Mathematics 2017-02-27 Danica Jakubíková-Studenovská , Reinhard Pöschel , Sándor Radeleczki

In this paper, the following results are proved: (1) $ $ If $E$ is a complete atomic lattice effect algebra, then $E$ is (o)-continuous iff $E$ is order-topological iff $E$ is totally order-disconnected iff $E$ is algebraic. (2) $ $ If $E$…

Mathematical Physics · Physics 2017-11-09 Lei Qiang , Wu Junde , Li Ronglu

We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's…

Discrete Mathematics · Computer Science 2024-05-07 Mohammad Abdulla , Johannes Hirth , Gerd Stumme

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

Logic in Computer Science · Computer Science 2017-01-12 Noam Zeilberger

It is old folklore that the violation of Leibniz rule on a lattice is an obstruction for constructing a lattice supersymmetric model. While it is still true for full supersymmetry, we show that a slightly modified form of the Leibniz rule,…

High Energy Physics - Lattice · Physics 2015-06-15 Mitsuhiro Kato , Makoto Sakamoto , Hiroto So

We consider the ring $\mathbb Z_n$ (integers modulo $n$) with the partial order `$\leq$' given by `$a \leq b$ if either $a=b$ or $a\equiv ab~(mod~n)$'. In this paper, we obtain necessary and sufficient conditions for the poset ($\mathbb…

Combinatorics · Mathematics 2017-04-18 Anil Khairnar , B. N. Waphare

We prove a linearization theorem for pre-rings of endogenies acting on a definable abelian group of finite dimension. Observe that no assumptions on the connectivity of A are made. We also prove a similar result when one of the two…

Group Theory · Mathematics 2025-11-11 Moreno Invitti

For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows:…

General Mathematics · Mathematics 2016-08-16 George Grätzer , Friedrich Wehrung

An $N=\infty$ equivalence among quenched $U(N)$ models on finite lattice tori of $V$ sites is proven to all orders in planar perturbation theory by putting circulant lattice momenta together with group indices on 't Hooft's double lines.…

High Energy Physics - Lattice · Physics 2022-07-12 Herbert Neuberger

Planar functions over finite fields give rise to finite projective planes and other combinatorial objects. They were originally defined only in odd characteristic, but recently Zhou introduced a definition in even characteristic which…

Combinatorics · Mathematics 2016-03-04 Zachary Scherr , Michael E. Zieve

Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute $\reg R(L)$ when $L$ is a planar lattice and give a lower bound for $\reg R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a…

Commutative Algebra · Mathematics 2013-07-31 Viviana Ene , Ayesha Asloob Qureshi , Asia Rauf

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

Formal Languages and Automata Theory · Computer Science 2011-11-03 Michał Skrzypczak

Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $\mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\mathsf{C}(L)$ of aggregation functions on $L$. The…

Rings and Algebras · Mathematics 2018-10-16 Radomír Halaš , Jozef Pócs

We establish several independent results concerning extremal, left modular, congruence uniform, and semidistributive lattices. An equivalent characterization of left modular lattices is obtained in terms of edge-labellings, together with…

Combinatorics · Mathematics 2025-12-01 Adrien Segovia

The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…

Logic · Mathematics 2023-06-13 Paolo Lipparini

We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.

Geometric Topology · Mathematics 2018-04-16 Ramin Naimi , Andrei Pavelescu , Elena Pavelescu

We prove the Cone Theorem for algebraically integrable foliations. As a consequence, we show that termination of flips implies the b-nefness of the moduli part of a log canonical pair with respect to a contraction, generalising the case of…

Algebraic Geometry · Mathematics 2022-03-03 Florin Ambro , Paolo Cascini , Vyacheslav Shokurov , Calum Spicer

In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb{Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a…

Logic · Mathematics 2025-03-26 Su Gao , Ming Xiao

For a lattice L, let Princ L denote the ordered set of principal congruences of L. In a pioneering paper, G. Gratzer characterized the ordered sets Princ L of finite lattices L; here we do the same for countable lattices. He also showed…

Rings and Algebras · Mathematics 2013-05-09 Gabor Czedli