Searcharxiv⌕ Search

arXiv subjects

Gábor Czédli

Publications and source records attributed to Gábor Czédli.

At least 37 records · Page 2Linked to original sources

Retracts of rectangular distributive lattices and some related observations

By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a lattice, which we denote by Ret($G$). Also, we describe and count the retracts of $G$. Some easy properties of retracts, retractions, and retraction kernels of (mainly distributive) lattices are observed and several examples are presented, including a 12-element modular lattice $M$ such that Ret($M$) is not a lattice.

math.RA↗

A property of meets in slim semimodular lattices and its application to retracts

Slim semimodular lattices were introduced by G. Grätzer and E. Knapp in 2007, and they have intensively been studied since then. It is often reasonable to give these lattices by their $\mathcal C_1$-diagrams defined by the author in 2017. We prove that if $x$ and $y$ are incomparable elements in such a lattice $L$, then the interval $[x\wedge y, x]$ is a chain and this chain is of a normal slope in every $\mathcal C_1$-diagram of $L$. Except possibly for $x$, the elements of this chain are meet-reducible. If $A $ and $X$ are subsets of a lattice $K$, then a sublattice $S$ of a lattice $L$ has the absorption property $(K,A ,X)$ if for every embedding $g: K\to L$ such that $g(A)\subseteq S$, we have that $g(X)\subseteq S$. If there is an idempotent endomorphism $f: L\to L$ such that $S=f(L)$, then the sublattice $S$ is a retract of $L$. Applying the above-mentioned property of meets, we present two absorption properties that the retracts of every slim semimodular lattice $L$ have.

math.RA↗

Length-preserving extensions of semimodular lattices by lowering join-irreducible elements

We prove that if $e$ is a join-irreducible element of a semimodular lattice $L$ of finite length and $h<e$ in $L$ such that $e$ does not cover $h$, then $e$ can be "lowered" to a covering of $h$ by taking a length-preserving semimodular extension $K$ of $L$ but not changing the rest of join-irreducible elements. With the help of our "lowering construction", we prove a general theorem on length-preserving semimodular extensions of semimodular lattices, which implies some earlier results proved by G. Grätzer and E. W. Kiss (1986), M. Wild (1993), and G. Czédli and E. T. Schmidt (2010) on extensions to geometric lattices, and even an unpublished result of E. T. Schmidt on higher dimensional rectangular lattices. Our method offers shorter proofs of these results than the original ones. To obtain the main tool used in the paper, we extend the bijective correspondence between finite semimodular lattices and Faigle geometries to an analogous correspondence between semimodular lattices of finite lengths and a larger class of geometries.

math.RA↗

Revisiting Faigle geometries from a perspective of semimodular lattices

In 1980, U. Faigle introduced a sort of finite geometries on posets that are in bijective correspondence with finite semimodular lattices. His result has almost been forgotten in lattice theory. Here we simplify the axiomatization of these geometries, which we call Faigle geometries. To exemplify their usefulness, we give a short proof of a theorem of Grätzer and E. Knapp (2009) asserting that each slim semimodular lattice $L$ has a congruence-preserving extension to a slim rectangular lattice of the same length as $L$. As another application of Faigle geometries, we give a short proof of G. Grätzer and E. W. Kiss' result from 1986 (also proved by M. Wild in 1993 and the present author and E. T. Schmidt in 2010) that each finite semimodular lattice $L$ has an extension to a geometric lattice of the same length as $L$.

math.CO↗

Absolute retracts for finite distributive lattices and slim semimodular lattices

We describe the absolute retracts for the following classes of finite lattices: (1) slim semimodular lattices, (2) finite distributive lattices, and for each positive integer $n$, (3) at most $n$-dimensional finite distributive lattices. Although the singleton lattice is the only absolute retract for the first class, this result has paved the way to some other classes. For the second class, we prove that the absolute retracts are exactly the finite boolean lattices; this generalizes a 1979 result of J. Schmid. For the third class, the absolute retracts are the finite boolean lattices of dimension at most $n$ and the direct products of $n$ nontrivial finite chains. Also, we point out that in each of these classes, the algebraically closed lattices and the strongly algebraically closed lattices are the same as the absolute retracts. Slim (and necessarily planar) semimodular lattices were introduced by G. Grätzer and E. Knapp in 2007, and they have been intensively studied since then. Algebraically closed and strongly algebraically closed lattices have been investigated by J. Schmid and, in several papers, by A. Molkhasi.

math.RA↗

Slim patch lattices as absolute retracts and maximal lattices

Patch lattices, introduced by G. Czédli and E.T. Schmidt in 2013, are the building stones for slim (and so necessarily finite and planar) semimodular lattices with respect to gluing. Slim semimodular lattices were introduced by G. Grätzer and E. Knapp in 2007, and they have been intensively studied since then. Outside lattice theory, these lattices played the main role in adding a uniqueness part to the classical Jordan--Hölder theorem for groups by G. Czédli and E.T. Schmidt in 2011, and they also led to results in combinatorial geometry. In this paper, we prove that slim patch lattices are exactly the absolute retracts with more than two elements for the category of slim semimodular lattices with length-preserving lattice embeddings as morphisms. Also, slim patch lattices are the same as the maximal objects $L$ in this category such that $|L|>2$. Furthermore, slim patch lattices are characterized as the algebraically closed lattices $L$ in this category such that $|L|>2$. Finally, we prove that if we consider $\{0,1\}$-preserving lattice homomorphisms rather than length-preserving ones, then the absolute retracts for the class of slim semimodular lattices are the at most 4-element boolean lattices.

math.RA↗

(1+1+2)-generated lattices of quasiorders

A lattice is $(1+1+2)$-generated if it has a four-element generating set such that exactly two of the four generators are comparable. We prove that the lattice Quo$(n)$ of all quasiorders (also known as preorders) of an $n$-element set is $(1+1+2)$-generated for $n=3$ (trivially), $n=6$ (when Quo(6) consists of $209\,527$ elements), n=11, and for every natural number $n\geq 13$. In 2017, the second author and J. Kulin proved that Quo$(n)$ is $(1+1+2)$-generated if either $n$ is odd and at least $13$ or $n$ is even and at least $56$. Compared to the 2017 result, this paper presents twenty-four new numbers $n$ such that Quo$(n)$ is $(1+1+2)$-generated. Except for Quo(6), an extension of Zádori's method is used.

math.CO↗

Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of ALL graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups, nor the ordered sets of join-irreducible congruences of slim semimodular lattices can be described by finitely many axioms in the class of FINITE structures. Since a 2007 result of G. Grätzer and E. Knapp, slim semimodular lattices have constituted the most intensively studied part of lattice theory and they have already led to results even in group theory and geometry. In addition to the non-axiomatizability results mentioned above, we present a new property, called Decomposable Cyclic Elements Property, of the congruence lattices of slim semimodular lattices.

math.LO↗

A new property of congruence lattices of slim, planar, semimodular lattices

The systematic study of planar semimodular lattices started in 2007 with a series of papers by G. Grätzer and E. Knapp. These lattices have connections with group theory and geometry. A planar semimodular lattice $L$ is {\it slim} if $M_3$ it is not a sublattice of $L$. In his 2016 monograph, "The Congruences of a Finite Lattice, A \emph{Proof-by-Picture Approach}", the second author asked for a characterization of congruence lattices of slim, planar, semimodular lattices. In addition to distributivity, both authors have previously found specific properties of these congruence lattices. In this paper, we present a new property, the {\it Three-pendant Three-crown Property}. The proof is based on the first author's papers: 2014 (multifork extensions), 2017 ($\mathcal C_1$-diagrams), and a recent paper (lamps), introducing the tools we need.

math.RA↗

Lamps in slim rectangular planar semimodular lattices

A planar (upper) semimodular lattice $L$ is slim if the five-element nondistributive modular lattice $M_3$ does not occur among its sublattices. (Planar lattices are finite by definition.) Slim rectangular lattices as particular slim planar semimodular lattices were defined by G. Grätzer and E. Knapp in 2007. In 2009, they also proved that the congruence lattices of slim planar semimodular lattices with at least three elements are the same as those of slim rectangular lattices. In order to provide an effective tool for studying these congruence lattices, we introduce the concept of lamps of slim rectangular lattices and prove several of their properties. Lamps and several tools based on them allow us to prove in a new and easy way that the congruence lattices of slim planar semimodular lattices satisfy the two previously known properties. Also, we use lamps to prove that these congruence lattices satisfy four new properties including the two-pendant four-crown property and the forbidden marriage property.

math.RA↗

On the number of atoms in three-generated lattices

As the main achievement of the paper, we construct a three-generated, 2-distributive, atomless lattice that is not finitely presented. Also, the paper contains the following three observations. First, every coatomless three-generated lattice has at least one atom. Second, we give some sufficient conditions implying that a three-generated lattice has at most three atoms. Third, we present a three-generated meet-distributive lattice with four atoms.

math.RA↗

Four-generated direct powers of partition lattices and authentication

For an integer $n\geq 5$, H. Strietz (1975) and L. Zádori (1986) proved that the lattice Part$(n)$ of all partitions of $\{1,2,\dots,n\}$ is four-generated. Developing L. Zádori's particularly elegant construction further, we prove that even the $k$-th direct power Part$(n)^k$ of Part$(n)$ is four-generated for many but only finitely many exponents $k$. E.g., Part$(n)^k$ is four-generated for every $k\leq 3\cdot 10^{89}$, and it has a four element generating set that is not an antichain for every $k\leq 1.4\cdot 10^{34}$. In connection with these results, we outline a protocol how to use these lattices in authentication and secret key cryptography.

math.RA↗

Four-element generating sets of partition lattices and their direct products

Let $n>3$ be a natural number. By a 1975 result of H. Strietz, the lattice Part$(n)$ of all partitions of an $n$-element set has a four-element generating set. In 1983, L. Zádori gave a new proof of this fact with a particularly elegant construction. Based on his construction from 1983, the present paper gives a lower bound on the number $ν(n)$ of four-element generating sets of Part$(n)$. We also present a computer assisted statistical approach to $ν(n)$ for small values of $n$. In his 1983 paper, L. Zádori also proved that for $n\geq 7$, the lattice Part$(n)$ has a four element generating set that is not an antichain. He left the problem whether such a generating set for $n\in\{5,6\}$ exists open. Here we solve this problem in negative for $n=5$ and in affirmative for $n=6$. Finally, the main theorem asserts that the direct product of some powers of partition lattices is four-generated. In particular, by the first part of this theorem, Part$(n_1)\times$ Part$(n_2)$ is four-generated for any two distinct integers $n_1$ and $n_2$ that are at least 5. The second part of the theorem is technical but it has two corollaries that are easy to understand. Namely, the direct product Part$(n)$ $\times$ Part$(n+1)$ $\times\dots\times$ Part$(3n-14)$ is four-generated for each integer $n\geq 9$. Also, for every positive integer $u$, the $u$-th the direct power of the direct product Part$(n)$ $\times$ Part$(n+1)$ $\times\dots\times$ Part$(n+u-1)$ is four-generated for all but finitely many $n$. If we do not insist on too many direct factors, then the exponent can be quite large. For example, our theorem implies that the $10^{127}$-th direct power of Part$(1011)$ $\times$ Part$(1012)$ $\times \dots \times$ Part$(2020)$ is four-generated.

math.CO↗

Doubling tolerances and coalition lattices

If every block of a (compatible) tolerance (relation) $T$ on a modular lattice $L$ of finite length consists of at most two elements, then we call $T$ a \emph{doubling tolerance} on $L$. We prove that, in this case, $L$ and $T$ determines a modular lattice of size $2|L|$. This construction preserves distributivity and modularity. In order to give an application of the new construct, let $P$ be a partially ordered set (poset). Following a 1995 paper by G.\ Pollák and the present author, the subsets of $P$ are called the \emph{coalitions} of $P$. For coalitions $X$ and $Y$ of $P$, let $X\leq Y$ mean that there exists an injective map $f$ from $X$ to $Y$ such that $x\leq f(x)$ for every $x\in X$. If $P$ is a finite chain, then its coalitions form a distributive lattice by the 1995 paper; we give a new proof of its distributivity by means of doubling tolerances.

math.RA↗

Medians are below joins in semimodular lattices of breadth 2

Let $L$ be a lattice of finite length and let $d$ denote the minimum path length metric on the covering graph of $L$. For any $ξ=(x_1,\dots,x_k)\in L^k$, an element $y$ belonging to $L$ is called a median of $ξ$ if the sum $d(y,x_1)+\cdots+d(y,x_k)$ is minimum. The lattice $L$ satisfies the $c_1$-median property if, for any $ξ=(x_1,\dots,x_k)\in L^k$ and for any median $y$ of $ξ$, $y\leq x_1\vee\dots\vee x_k$. Our main theorem asserts that if $L$ is an upper semimodular lattice of finite length and the breadth of $L$ is less than or equal to $2$, then $L$ satisfies the $c_1$-median property. Also, we give a construction that yields semimodular lattices, and we use a particular case of this construction to prove that our theorem is sharp in the sense that $2$ cannot be replaced by $3$.

math.RA↗

Permuting 2-uniform tolerances on lattices

A $2$-uniform tolerance on a lattice is a compatible tolerance relation such that all of its blocks are 2-element. We characterize permuting pairs of 2-uniform tolerances on lattices of finite length. In particular, any two 2-uniform congruences on such a lattice permute.

math.RA↗

Planar semilattices and nearlattices with eighty-three subnearlattices

Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element nearlattice has at least $83\cdot 2^{n-8}$ subnearlattices, then it has a planar Hasse diagram. For $n>8$, this result is sharp.

math.RA↗

Eighty-three sublattices and planarity

Let $L$ be a finite $n$-element lattice. We prove that if $L$ has at least $83\cdot 2^{n-8}$ sublattices, then $L$ is planar. For $n>8$, this result is sharp since there is a non-planar lattice with exactly $83\cdot 2^{n-8}-1$ sublattices.

math.RA↗