Related papers: Eighty-three sublattices and planarity

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

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…

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

We investigate the properties of the zeta-function of well-rounded sublattices of a fixed arithmetic lattice in the plane. In particular, we show that this function has abscissa of convergence at $s=1$ with a real pole of order 2, improving…

Let $\mathcal{B}$ be a compact convex planar domain with smooth boundary of finite type and $\mathcal{B}_\theta$ its rotation by an angle $\theta$. We prove that for almost every $\theta\in[0, 2\pi]$ the remainder…

A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs).…

A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…

The $\textit{planar Tur\'an number}$ $\textrm{ex}_{\mathcal P}(n,H)$ of a graph $H$ is the maximum number of edges in an $n$-vertex planar graph without $H$ as a subgraph. Let $C_{\ell}$ denote the cycle of length $\ell$. The planar Tur\'an…

In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible.

A graph $G$ is $k$-degenerate if it can be transformed into an empty graph by subsequent removals of vertices of degree $k$ or less. We prove that every connected planar graph with average degree $d \ge 2$ has a 4-degenerate induced…

We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.

This paper gives a simple proof of the result that every planar graph $G$ has Alon-Tarsi number at most 5, and has a matching $M$ such that $G-M$ has Alon-Tarsi number at most 4.

We consider 3-regular planar matchstick graphs, i.e. those which have a planar embedding such that all edge lengths are equal, with given girth g. For girth 3 it is known that such graphs exist if and only if the number of vertices n is an…

An abstract polytope is \emph{flat} if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat…

We survey results concerning special elements of nine types (modular, lower-modular, upper-modular, cancellable, distributive, codistributive, standard, costandard and neutral elements) in the lattice of all semigroup varieties and certain…

A 1984 problem of S.Z. Ditor asks whether there exists a lattice of cardinality aleph two, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice…

We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite…

We classify integral rootless lattices which are sums of pairs of $EE_8$-lattices (lattices isometric to $\sqrt 2$ times the $E_8$-lattice) and which define dihedral groups of orders less than or equal to 12. Most of these may be seen in…

A graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains…