中文
相关论文

相关论文: Planar semilattices and nearlattices with eighty-t…

200 篇论文

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.

环与代数 · 数学 2019-07-03 Gábor Czédli

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

环与代数 · 数学 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…

环与代数 · 数学 2018-09-27 Gábor Czédli

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

环与代数 · 数学 2013-01-01 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…

环与代数 · 数学 2018-01-08 Gábor Czédli

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

环与代数 · 数学 2016-10-18 Artem N. Shevlyakov

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

环与代数 · 数学 2021-02-17 Fernando Martin-Maroto , Gonzalo G. de Polavieja

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…

环与代数 · 数学 2014-04-29 George Grätzer

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…

组合数学 · 数学 2021-06-17 George Grätzer

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…

环与代数 · 数学 2024-11-01 Gábor Czédli

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

数论 · 数学 2026-01-15 J. E. Cremona , P. Koymans

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…

组合数学 · 数学 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…

组合数学 · 数学 2020-07-08 Jukka Kohonen

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…

环与代数 · 数学 2018-01-22 J\' ulia Kulin , Claudia Mureşan

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

环与代数 · 数学 2019-01-01 Gábor Czédli , Eszter K. Horváth

We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.

逻辑 · 数学 2010-11-11 Pedro Sánchez Terraf

The similar sublattices of a planar lattice can be classified via its multiplier ring. The latter is the ring of rational integers in the generic case, and an order in an imaginary quadratic field otherwise. Several classes of examples are…

度量几何 · 数学 2019-08-15 Michael Baake , Rudolf Scharlau , Peter Zeiner

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.

几何拓扑 · 数学 2016-03-22 Samuel A. Ballas , Darren Long

A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…

数论 · 数学 2019-06-25 Michael Baake , Rudolf Scharlau , Peter Zeiner

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…

环与代数 · 数学 2021-03-02 Gábor Czédli
‹ 上一页 1 2 3 10 下一页 ›