Related papers: A constant lower bound for the union-closed sets c…

We prove a lower bound for the Cheeger constant of a cylinder $\Omega\times (0,L)$, where $\Omega$ is an open and bounded set. As a consequence, we obtain existence of minimizers for the shape functional defined as the ratio between the…

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

We prove that for any isomorphism $h: \mathcal{K}_1 \to \mathcal{K}_2$ between pure union-closed families, there exists a hyperisomorphism $H: \bigcup \mathcal{K}_1 \to \bigcup \mathcal{K}_2$ such that $h(A) = \{ H(a) \mid a \in A \}$, for…

In this paper we investigate the minimum number of maximal subgroups H_i for i=1 ...k of the symmetric group S_n (or the alternating group A_n) such that each element in the group S_n (respectively A_n) lies in some conjugate of one of the…

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

This paper resolves two open problems in extremal set theory. For a family $\mathcal{F} \subseteq 2^{[n]}$ and $i, j\in [n]$, we denote $\mathcal{F} (i,\bar{j})=\{F\backslash\{i\}: F\in \mathcal{F}, F\cap\{i,j\}=\{i\}\}$. The sturdiness…

We show that, when $sp>N$, the sharp Hardy constant $\mathfrak{h}_{s,p}$ of the punctured space $\mathbb R^N\setminus\{0\}$ in the Sobolev-Slobodecki\u{\i} space provides an optimal lower bound for the Hardy constant…

We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.

Let $\Omega$ be a bounded open set of class $C^{1,1}$ in $\mathbb{R}^N$ and $s\in(\frac{1}{2}, 1)$. We study a family of fractional Hardy-type inequalities \begin{equation}…

One of the prominent open problems in combinatorics is the discrepancy of set systems where each element lies in at most $t$ sets. The Beck-Fiala conjecture suggests that the right bound is $O(\sqrt{t})$, but for three decades the only…

Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…

The notions of infimum and maximal lower bounds of a set $\mathfrak M$ of bounded self-adjoint operators were mainly studied for a set $\mathfrak M$ of two elements. The present paper deals with more general sets $\mathfrak M$, where it is…

For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n =…

A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $\#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$.…

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ is the maximum degree. The lower bound by Linial…

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

A family of sets $\mathcal{F} \subseteq 2^{[n]}$ is defined to be $l$-trace $k$-Sperner if for any $l$-subset $L$ of $[n]$ the family of traces $\mathcal{F}|_L=\{F \cap L: F \in \mathcal{F}\}$ does not contain any chain of length $k+1$. In…

We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by…

We prove a sharp bound for the minimal doubling of a small measurable subset of a compact connected Lie group. Namely, let $G$ be a compact connected Lie group of dimension $d_G$, we show that for for all measurable subsets $A$, we have…

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…