English
Related papers

Related papers: Eighty-three sublattices and planarity

200 papers

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

Rings and Algebras · Mathematics 2019-07-03 Gábor Czédli

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…

Rings and Algebras · Mathematics 2018-09-27 Gábor Czédli

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…

Rings and Algebras · Mathematics 2019-08-23 Gábor Czédli

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

Rings and Algebras · Mathematics 2019-01-01 Gábor Czédli , Eszter K. Horváth

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…

Rings and Algebras · Mathematics 2017-12-19 Gábor Czédli

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…

Rings and Algebras · Mathematics 2024-11-01 Gábor Czédli

We study the smallest, as well as the largest numbers of congruences of lattices of an arbitrary finite cardinality $n$. Continuing the work of Freese and Cz\' edli, we prove that the third, fourth and fifth largest numbers of congruences…

Rings and Algebras · Mathematics 2018-01-22 J\' ulia Kulin , Claudia Mureşan

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

Number Theory · Mathematics 2026-01-15 J. E. Cremona , P. Koymans

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…

Rings and Algebras · Mathematics 2014-04-29 George Grätzer

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…

Combinatorics · Mathematics 2024-08-20 Delbrin Ahmed , Muwafaq Salih , Dilbak Haje

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…

Combinatorics · Mathematics 2020-07-08 Jukka Kohonen

We prove that the two-colouring number of any planar graph is at most 8. This resolves a question of Kierstead et al. [SIAM J. Discrete Math.~23 (2009), 1548--1560]. The result is optimal.

Combinatorics · Mathematics 2019-10-18 Zdeněk Dvořák , Adam Kabela , Tomáš Kaiser

We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…

Functional Analysis · Mathematics 2021-02-05 Albrecht Boettcher , Lenny Fukshansky , Stephan Ramon Garcia , Hiren Maharaj , Deanna Needell

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

Combinatorics · Mathematics 2026-03-24 Akira Iino , Masashi Sakiyama

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…

Rings and Algebras · Mathematics 2012-08-31 Gábor Czédli , Tamás Dékány , László Ozsvárt , Nóra Szakács , Balázs Udvari

By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…

Rings and Algebras · Mathematics 2026-02-05 Gábor Czédli

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…

Rings and Algebras · Mathematics 2018-01-08 Gábor Czédli

An even lattice $M$ of signature $(n,2)$ is called $2$-reflective if there is a non-constant modular form for the orthogonal group of $M$ which vanishes only on quadratic divisors orthogonal to $2$-roots of $M$. In [Amer. J. Math. 2017]…

Number Theory · Mathematics 2023-01-30 Haowu Wang

In this note, we discuss planar lattices generated by their atoms. We prove that if $L$ is a planar lattice generated by $n$ atoms, then both the left and the right boundaries of $L$ have at most $n+1$ elements. On the other hand, $L$ can…

Rings and Algebras · Mathematics 2021-04-29 G. Grätzer

In this paper we find infinitely many lattices in $SL(4,\mathbb{R})$ each of which contains thin subgroups commensurable with the figure-eight knot group.

Geometric Topology · Mathematics 2016-03-22 Samuel A. Ballas , Darren Long
‹ Prev 1 2 3 10 Next ›