Searcharxiv⌕ Search

arXiv subjects

George Grätzer

Publications and source records attributed to George Grätzer.

At least 19 recordsLinked to original sources

The $A^A$ problem for finite ordered sets

For ordered sets $X$ and $Y$, let $Y^X$ denote the ordered set of order-preserving maps from $X$ to $Y$, ordered pointwise. In 1984, D. Duffus asked whether $A^A\cong B^B$ forces $A\cong B$ when $A$ and $B$ are finite ordered sets. We prove that it does. The proof combines direct decompositions with an auxiliary ordering of connected ordered sets and a careful choice of intervals of maximum height. We then extend the reconstruction result to several forms of repeated exponentiation.

math.CO↗

Congruence density under sublattice inclusion

Following Gábor Czédli, the \emph{congruence density} of a finite lattice $A$ is $\cd(A)=|\Con A|/2^{|A|-1}$, where $\Con A$ is its congruence lattice and $|A|$ is its number of elements. Czédli proved that density cannot increase under several kinds of sublattice extension and asked whether this holds for every sublattice inclusion. For a sublattice $S$ of $L$, we prove the stronger inequality $\cd(L)\leq2^{-d}\cd(S)$, where $d$ is the larger of the increases in the numbers of join-reducible and meet-reducible elements. The proof follows congruence labels along the chains into which prime intervals of $S$ split in $L$. We also prove that $\cd(L)=\cd(S)$ if and only if every element of $L-S$ is comparable with every element of $L$. The theorem of G. Czédli and L.~Szabó relating compatible quasiorders to pairs of congruences gives the corresponding quasiorder-density results.

math.RA↗

Generalizing the $A^A$ Problem for Finite Ordered Sets

Let X and Y be finite ordered sets and let $X^Y$ denote the ordered set of order-preserving maps from $Y$ to $X$. Let $t$ be a~term formed from a~single variable by exponentiation. We prove that, for every term $t$ with at most twelve variable occurrences and arbitrary finite ordered sets $A,B$, $t(A)\cong t(B)$ implies that $A\cong B$. General constructions and reconstruction principles are developed first; the second part gives the occurrence-by-occurrence proofs. At twelve occurrences the proof covers 4,766 interchange normal forms, representing all 58,786 binary parenthesizations, including 40 exceptional forms. Two additional unbounded reconstruction families, complete finite audit data, and 457 exact height-comparison certificates are included.

math.RA↗

Notes on the ordered set $A^A$ II. Higher Exponentials

For the finite ordered sets $A, D$, write $A^D$ for the ordered set of isotone maps $D \to A$ with the pointwise order. It was proved in earlier work that the order structure of $A^A$ determines~$A$ up to isomorphism. In this note we extend the result to higher function ordered sets such as $A^{(A^A)}$ and $(A^A)^A$. Our main theorem shows that the structure of $A^D$ determines~$A$.

math.CO↗

Planar, infinite, semidistributive lattices

An FN lattice $F$ is a simple, infinite, semidistributive lattice. Its existence was recently proved by R. Freese and J.\,B. Nation. Let $\mathsf{B}_n$ denote the Boolean lattice with $n$ atoms. For a lattice $K$, let $K^+$ denote $K$ with a new unit adjoined. We prove that the finite distributive lattices: $\mathsf{B}_0^+, \mathsf{B}_1^+,\mathsf{B}_2^+, \dots$ can be represented as congruence lattices of infinite semidistributive lattices. The case $n = 0$ is the Freese-Nation result, which is utilized in the proof. We also prove some related representation theorems.

math.RA↗

On a property of congruence lattices of slim, planar, semimodular lattices

In a 2121 paper with Gábor Czédli, we introduced and verified the Three-pendant Three-crown Property, 3P3C, for congruence lattices of slim, planar, semimodular lattices. The proof is very long; in part, because it relies on Czédli's 2021 paper on lamps. This paper verifies 3P3C using the Swing Lemma, an elementary and short approach.

math.RA↗

An open problem on congruences of finite lattices

Let $L$ be a planar semimodular lattice. We call $L$ \emph{slim}, if it has no $\mthree$ sublattice. Let us define an \emph{SPS lattice} as a slim, planar, semimodular lattice $L$. In 2016, I proved a property of congruences of SPS lattices (Two-cover Property) and raised the problem of characterizing them. Since then, more than 50 papers have been published contributing to this problem. In this survey, I provide an overview of this field with major contributions by Gábor Czédli.

math.RA↗

On slim rectangular lattices

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain an ${\mathsf M}_3$-sublattice). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are complementary $a, b \in I$ such that $a$ is to the left of $b$. We claim that a rectangular interval of a slim rectangular lattice is also a slim rectangular lattice. We will present some applications, including a recent result of G. Czédli. In a paper with E. Knapp about a dozen years ago, we introduced natural diagrams} for slim rectangular lattices. Five years later, G. Czédli introduced ${\E C}_1$-diagrams} We prove that they are the same.

math.RA↗

Another research note

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $i = u_l \vee u_r$ and $o = u_l \wedge u_r$ where $u_l$ is to the left of $u_r$. \emph{The first result}: a rectangular interval of a rectangular lattice is a rectangular lattice. As an application, we get a recent result of G. Czédli. In a 2017 paper, G. Czédli introduced a very powerful diagram type for slim, planar, semimodular lattices, the \emph{$\mathcal{C}_1$-diagrams}. We revisit the concept of \emph{natural diagrams} I introduced with E.~Knapp about a dozen years ago. Given a slim rectangular lattice $L$, we construct its natural diagram in one simple step. \emph{The second result} shows that for a slim rectangular lattice, a~natural diagram is the same as a $\mathcal{C}_1$-diagram. Therefore, natural diagrams have all the nice properties of $\mathcal{C}_1$-diagrams.

math.RA↗

Homomorphisms of distributive lattices as restrictions of congruences. III. Rectangular lattices and two convex sublattices

Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In a 2012 paper, G. Czédli proved an analogous result for rectangular lattices. In this paper, we prove a stronger form of Czédli's result and provide a short, elementary, and direct proof.

math.RA↗

Using the Swing Lemma and $\mathcal{C}_1$-diagrams for congruences of planar semimodular lattices

A planar semimodular lattice $K$ is \emph{slim} if $\mathsf{M}_{3}$ is not a sublattice of~$K$. In a recent paper, G. Czédli found four new properties of congruence lattices of slim, planar, semimodular lattices, including the \emph{No Child Property}: \emph{Let~$\mathcal{P}$ be the ordered set of join-irreducible congruences of $K$. Let $x,y,z \in \mathcal{P}$ and let $z$ be a~maximal element of $\mathcal{P}$. If $x \neq y$ and $x, y \prec z$ in $\mathcal{P}$, then there is no element $u$ of $\mathcal{P}$ such that $u \prec x, y$ in $\mathcal{P}$.} We are applying my Swing Lemma, 2015, and a type of standardized diagrams of Czédli's, to verify his four properties.

math.RA↗

Characterizing representability by principal congruences for finite distributive lattices with a join-irreducible unit element

For a finite distributive lattice $D$, let us call $Q \subseteq D$ \emph{principal congruence representable}, if there is a finite lattice $L$ such that the congruence lattice of $L$ is isomorphic to $D$ and the principal congruences of $L$ correspond to $Q$ under this isomorphism. We find a necessary condition for representability by principal congruences and prove that for finite distributive lattices with a join-irreducible unit element this condition is also sufficient.

math.RA↗

Zilber's Theorem for planar lattices, revisited

Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and an analysis of coverings in the left-right order.

math.RA↗

Using the Swing Lemma and Czédli diagrams for congruences of planar semimodular lattices

A planar semimodular lattice $K$ is \emph{slim} if $\mathsf{M}_3$ is not a sublattice of~$K$. In a recent paper, G. Czédli found four new properties of congruence lattices of slim, planar, semimodular lattices, including the \emph{No Child Property}: \emph{Let~$P$ be the ordered set of join-irreducible congruences of $K$. Let $x,y,z \in P$ and let $z$ be a~maximal element of $P$. If $x \neq y$, $x, y \prec z$ in $P$, then there is no element $u$ of $P$ such that $u \prec x, y$ in $P$.} We are applying my Swing Lemma, 2015, and a type of standardized diagrams of Czédli's, to verify Czédli's four properties.

math.RA↗