Related papers: Improved bounds on the Hadwiger-Debrunner numbers

A conjecture of Erd\H{o}s states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that,…

The Hadwiger number $h(G)$ is the order of the largest complete minor in $G$. Does sufficient Hadwiger number imply a minor with additional properties? In [2], Geelen et al showed $h(G)\geq (1+o(1))ct\sqrt{\ln t}$ implies $G$ has a…

We show that the condition number of any cyclically contiguous $p\times q$ submatrix of the $N\times N$ discrete Fourier transform (DFT) matrix is at least $$ \exp \left( \frac{\pi}{2} \left[\min(p,q)- \frac{pq}{N}\right] \right)~, $$ up to…

More than 70 years ago, P. Hall showed that if $G$ is a finite $p$-group such that a term $\der G{d+1}$ of the derived series is non-trivial, then the order of the quotient $\der Gd/\der G{d+1}$ is at least $p^{2^d+1}$. Recently Mann proved…

Let $(P,E)$ be a $(d+1)$-uniform geometric hypergraph, where $P$ is an $n$-point set in general position in $\mathbb{R}^d$ and $E\subseteq {P\choose d+1}$ is a collection of $\epsilon{n\choose d+1}$ $d$-dimensional simplices with vertices…

We give a self-contained proof of the fact that, for any prime number $p$, there exists a power series $$\Psi= \Psi_p(T) \in T + T^2\Z[[T]] $$ which trivializes the addition law of the formal group of Witt covectors is $p$-adically entire…

Let $La(n,P)$ be the maximum size of a family of subsets of $[n]= \{1,2, ..., n \}$ not containing $P$ as a (weak) subposet, and let $h(P)$ be the length of a longest chain in $P$. The best known upper bound for $La(n,P)$ in terms of $|P|$…

An $\epsilon$-net theorem for a hypergraph upper bounds the minimum size of a vertex set that pierces all $\epsilon$-heavy hyperedges. A $(p,2)$-theorem bounds from above the minimum size of a vertex set that pierces all hyperedges, in…

For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is…

Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutive integers of the form $p^a\cdot q^b$ with $a,b\ge 0$. Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size…

Denote by ${\mathfrak s}({\mathbb F}_p^d)$ the Erd{\H o}s--Ginzburg--Ziv constant of ${\mathbb F}_p^d$, that is, the minimum $s$ such that any sequence of $s$ vectors in ${\mathbb F}_p^d$ contains $p$ vectors whose sum is zero. Let…

Let $1<q<p<\infty$, $\frac1r:=\frac1q-\frac1p$, and $T$ be a non-degenerate Calder\'on--Zygmund operator. We show that the commutator $[b,T]$ is compact from $L^p({\mathbb R}^n)$ to $L^q({\mathbb R}^n)$ if and only if the symbol $b=a+c$…

For $p,q\geq2$, the Hardy and Littlewood inequalities for real bilinear forms, in its unified formulation, assert that there is a constant $C_{p,q}\geq1$ such that \begin{equation}…

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a…

We verify that $\liminf_{q\to\infty} q\cdot |q|_p\cdot ||qx||<\epsilon$ for all real $x$, small primes $p$ and relatively small $\epsilon$. This result supports the famous $p$-adic Littlewood conjecture which states that the above lower…

In this paper we improve the bounds for the Carath\'eodory number, especially on algebraic varieties and with small gaps (not all monomials are present). We provide explicit lower and upper bounds on algebraic varieties, $\mathbb{R}^n$, and…

For $w$ in the symmetric group, we provide an exact formula for the smallest positive power $q^{h(w)}$ appearing in the Kazhdan-Lusztig polynomial $P_{e,w}(q)$. We also provide a tight upper bound on $h(w)$ in simply-laced types, resolving…

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.