English
Related papers

Related papers: Some new Bollob\'as-type inequalities

200 papers

We provide a number of new quantitative versions of Helly's theorem. For example, we show that for every family $\{P_i:i\in I\}$ of closed half-spaces $$P_i=\{x\in {\mathbb R}^n:\langle x,w_i\rangle \leq 1\}$$ in ${\mathbb R}^n$ such that…

Functional Analysis · Mathematics 2015-09-22 Silouanos Brazitikos

Given a sequence of frequencies $\{\lambda_n\}_{n\geq1}$, a corresponding generalized Dirichlet series is of the form $f(s)=\sum_{n\geq 1}a_ne^{-\lambda_ns}$. We are interested in multiplicatively generated systems, where each number…

Number Theory · Mathematics 2024-05-08 Frederik Broucke , Athanasios Kouroupis , Karl-Mikael Perfekt

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

Combinatorics · Mathematics 2011-09-05 Cheng Yeaw Ku , Kok Bin Wong

We show that the system of equations \begin{align*} \sum_{i=1}^s (x_i^j-y_i^j) = a_j \qquad (1 \le j \le k) \end{align*} has appreciably fewer solutions in the subcritical range $s < k(k+1)/2$ than its homogeneous counterpart, provided that…

Number Theory · Mathematics 2021-10-07 Julia Brandes , Kevin Hughes

In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…

Functional Analysis · Mathematics 2021-12-01 Theophilus Agama

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

Combinatorics · Mathematics 2010-09-14 Karsten Chipeniuk

The conjecture of Bollob\'as and Koml\'os, recently proved by B\"ottcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $\gamma>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and…

Combinatorics · Mathematics 2011-07-28 Julia Böttcher , Peter Christian Heinig , Anusch Taraz

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…

Number Theory · Mathematics 2014-10-14 Liuquan Wang

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

Bollob\'{a}s-type theorem has received a lot of attention due to its application in graph theory. In 2015, G\'{a}bor Heged{\"u}s gave an upper bound of bollob\'{a}s-type affine subspace families for $q\neq 2$, and constructed an almost…

Combinatorics · Mathematics 2025-01-17 Shuhui Yu , Xin Wang

In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation. This result shows that for a family of limsup sets,…

Dynamical Systems · Mathematics 2020-10-20 Simon Baker

The Brunn-Minkowski inequality states that for bounded measurable sets $A$ and $B$ in $\mathbb{R}^n$, we have $|A+B|^{1/n} \geq |A|^{1/n}+|B|^{1/n}$. Also, equality holds if and only if $A$ and $B$ are convex and homothetic sets in…

Analysis of PDEs · Mathematics 2023-11-01 Alessio Figalli , Peter van Hintum , Marius Tiba

Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the…

Algebraic Geometry · Mathematics 2021-10-26 I. Nikitin

Two families $\mathcal A$ and $\mathcal B$ of $k$-subsets of an $n$-set are called cross-intersecting if $A\cap B\ne\emptyset$ for all $A\in \mathcal A, B\in \mathcal B $. Strengthening the classical Erd\H os-Ko-Rado theorem, Pyber proved…

Combinatorics · Mathematics 2017-12-01 Peter Frankl , Andrey Kupavskii

A residuated semigroup is a structure $\langle A,\le,\cdot,\backslash,/ \rangle$ where $\langle A,\le \rangle$ is a poset and $\langle A,\cdot \rangle$ is a semigroup such that the residuation law $x\cdot y\le z\iff x\le z/y\iff y\le x…

Logic in Computer Science · Computer Science 2025-05-20 Stefano Bonzio , José Gil-Férez , Peter Jipsen , Adam Přenosil , Melissa Sugimoto

We prove that there is an absolute constant $c > 0$ such that for every $$a_0,a_1, \ldots,a_n \in [1,M]\,, \qquad 1 \leq M \leq \frac 14 \exp \left( \frac n9 \right)\,,$$ there are $$b_0,b_1,\ldots,b_n \in \{-1,0,1\}$$ such that the…

Number Theory · Mathematics 2024-10-17 Tamás Erdélyi

Two families $\mathcal{F}$ and $\mathcal{G}$ are called cross-intersecting if for every $F\in \mathcal{F}$ and $G\in \mathcal{G}$, the intersection $F\cap G$ is non-empty. For any positive integers $n$ and $k$, let $\binom{[n]}{k}$ denote…

Combinatorics · Mathematics 2025-05-13 Yongjiang Wu , Lihua Feng , Yongtao Li

This paper proposes an algorithm for deciding consistency of systems of Boolean equations in several variables with co-efficients in the two element Boolean algebra $B_{0}=\{0,1\}$ and find all satisfying assignments. The algorithm is based…

Data Structures and Algorithms · Computer Science 2014-07-16 Virendra Sule

Given a matrix $A$, let $A_{I,J}$ denote the submatrix of $A$ determined by rows $I$ and columns $J$. Fischer's Inequalities state that for each $n \times n$ Hermitian positive semidefinite matrix $A$, and each subset $I$ of…

Combinatorics · Mathematics 2022-10-04 Mark Skandera , Daniel Soskin

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…

Combinatorics · Mathematics 2018-08-09 Pierre-Yves Bienvenu , Thái Hoàng Lê