相关论文: One hundred twenty-seven subsemilattices and plana…
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.
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…
Let $L$ be an $n$-element finite lattice. We prove that if $L$ has strictly more than $2^{n-5}$ congruences, then $L$ is planar. This result is sharp, since for each natural number $n\geq 8$, there exists a non-planar lattice with exactly…
For every natural number $n\geq 5$, we prove that the number of subuniverses of an $n$-element lattice is $2^n$, $13\cdot 2^{n-4}$, $23\cdot 2^{n-5}$, or less than $23\cdot 2^{n-5}$. By a subuniverse, we mean a sublattice or the emptyset.…
Let $(L,\vee)$ be a finite n-element semilattice where $n\geq 5$. We prove that the fourth largest number of subuniverses of an $n$-element semilattice is $25\cdot 2^{n-5}$, the fifth largest number is $ 24.5\cdot 2^{n-5}$, and the sixth…
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. We prove that there exists a positive constant C such that, up to similarity, the number of planar diagrams of these…
In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations.…
By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…
For an integer $n\geq 2$, let NCSL$(n)$ denote the set of sizes of congruence lattices of $n$-element semilattices. We find the four largest numbers belonging to NCSL$(n)$, provided that $n$ is large enough to ensure that $|$NCSL$(n)|\geq…
Let T(X) be the semigroup of full transformations on a finite set X with n elements. We prove that every subsemilattice of T(X) has at most 2^{n-1} elements and that there are precisely n subsemilattices of size exactly 2^{n-1}, each…
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…
A planar semimodular lattice is slim if it does not contain $M_3$ as a sublattice. An SPS lattice is a slim, planar, semimodular lattice. A recent result of G\'abor Cz\'edli proves that there is an eight element (planar) distributive…
In this article, we prove that finite semidistributive lattices are dismantlable if and only if they are planar. This extends a well-known result by Kelly and Rival that states the same property for finite distributive lattices. Moreover,…
A planar semimodular lattice $L$ is \emph{slim} if $\mathbf{M}_3$ is not a sublattice of $L$. In a recent paper, G. Cz\'edli introduced a very powerful diagram type for slim, planar, semimodular lattices. This short note proves the…
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…
We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
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…
For a planar integral lattice $L$, let $\nu(L)$ denote the square-free part of the integer $D(L)^2$, where $D(L)$ stands for the area of a fundamental parallelogram of $L$. For each odd integer $n$ with $3 \leq n<29$, a planar lattice $L$…