Related papers: On Helly numbers of exponential lattices

We prove that for a topological space X with the property that $H_p(U)=0$ for $p\geq d$ and every open subset $U$ of $X$, a finite family of open sets in $X$ has nonempty intersection if for any subfamily of size $j$, $1\leq j \leq d+1$,…

For a non-negative integer $s\le |V(G)|-3$, a graph $G$ is $s$-Hamiltonian if the removal of any $k\le s$ vertices results in a Hamiltonian graph. Given a connected simple graph $G$ that is not isomorphic to a path, a cycle, or a $K_{1,3}$,…

Let $E(k, \ell)$ denote the smallest integer such that any set of at least $E(k, \ell)$ points in the plane, no three on a line, contains either an empty convex polygon with $k$ vertices or an empty pseudo-triangle with $\ell$ vertices. The…

Alanzi et al. (2022) investigated overpartition of a positive integer $n$ with $\ell$-regular non-overlined parts denoted by $\overline R_\ell^\ast (n)$, and proved some results for the case $\ell=3$. As extension to the results of Alanzi…

We show that the Carath\'eodory number for $H$-convexity is the maximum of two parameters: the Helly number for $H$-convexity and the cone number of $H$. The cone number in this article is defined as the maximal number of points of $H$ in…

In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on…

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…

The induced Ramsey number $R_{\mathrm{ind}}(H; r)$ of a graph $H$ is the minimum number $N$ such that there exists a graph with $N$ vertices for which all $r$-colourings of its edges contain a monochromatic induced copy of $H$. Our main…

A basic measure of the combinatorial complexity of a convexity space is its Radon number. In this paper we show a fractional Helly theorem for convexity spaces with a bounded Radon number, answering a question of Kalai. As a consequence we…

Let $\beta_1,...,\beta_n$ be distinct points in the open unit disc in the complex plane, none of which is the origin, and let $H^1$ be the Hardy space. Define a closed convex set in $\mathbb{C}^{n}$ by $\Lambda = \{…

Let $\mathbb{H}^{n}$ be the Heisenberg group and $Q = 2n+2$. For $1 < q < \infty$, $\gamma > 0$ and an exponent function $p(\cdot)$ on $\mathbb{H}^n$, which satisfy log-H\"older conditions, with $0 < p_{-} \leq p_{+} < \infty$, we introduce…

The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of $\alpha$-powers of finitely many homothety…

We show the existence of an absolute constant $\alpha>0$ such that, for every $k \geq 3$, $G:=\mathop{\mathrm{Sym}}(k)$, and for every $H \leqslant G$ of index at least $3$, one has $|H/[H,H]| \leq |G:H|^{\alpha/ \log \log |G:H|}$. This…

Let $G$ be a graph with degree sequence $d_1\geq \ldots \geq d_n$. Slater proposed $s\ell(G)=\min\{ s: (d_1+1)+\cdots+(d_s+1)\geq n\}$ as a lower bound on the domination number $\gamma(G)$ of $G$. We show that deciding the equality of…

We generalize a classical theorem of Besicovitch, showing that, for any positive integers $k<n$, if $E\subset \mathbb R^n$ is a Souslin set which is not $\mathcal{H}^k$-$\sigma$-finite, then $E$ contains a purely unrectifiable closed set…

We prove that every finitely presented group with positive first $\ell^2$-Betti number that virtually surjects onto $\mathbb Z$ is acylindrically hyperbolic. In particular, this implies acylindrical hyperbolicity of finitely presented…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains a copy of $F$ or its complement contains $H$. Burr in 1981 proved a pleasingly general result that for any graph $H$, provided $n$ is…

For a real number $\theta$, let $\Vert\theta\Vert$ denote the distance from $\theta$ to the nearest integer. A set of positive integers $\mathcal H$ is a Heilbronn set if for every $\alpha\in \mathbb R$ and every $\epsilon>0$ there exists…