English
Related papers

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

200 papers

Given $k$ sets $\mathcal{A}_i \subseteq \mathbb{F}_q^d$ and a non-degenerate bilinear form $B$ in $\mathbb{F}_q^d$. We consider the system of $l \leq \binom{k}{2}$ bilinear equations \[ B (\tmmathbf{a}_i, \tmmathbf{a}_j) = \lambda_{i j},…

Combinatorics · Mathematics 2009-03-09 Le Anh Vinh

The main aim of this paper is to prove a Bishop-Phelps-Bollob\'as type theorem on the unital uniform algebra A_{w^*u}(B_{X^*}) consisting of all w^*-uniformly continuous functions on the closed unit ball B_{X^*} which are holomorphic on the…

Functional Analysis · Mathematics 2017-07-24 Sheldon Dantas , Domingo García , Sun Kwang Kim , Un Young Kim , Han Ju Lee , Manuel Maestre

We prove that given a constant $k \ge 2$ and a large set system $\mathcal{F}$ of sets of size at most $w$, a typical $k$-tuple of sets $(S_1, \cdots, S_k)$ from $\mathcal{F}$ can be ``blown up" in the following sense: for each $1 \le i \le…

Combinatorics · Mathematics 2025-06-03 Ryan Alweiss

The classical inequality of Bohr asserts that if a power series converges in the unit disk and its sum has modulus less than or equal to $1$, then the sum of absolute values of its terms is less than or equal to $1$ for the subdisk…

Complex Variables · Mathematics 2020-06-12 Saminathan Ponnusamy , Ramakrishnan Vijayakumar , Karl-Joachim Wirths

Let $A_i$ and $B_i$ be positive definite matrices for all $i=1,\cdots,m.$ It is shown that $$\left|\left|\sum_{i=1}^m(A_i^2\sharp…

Functional Analysis · Mathematics 2022-10-26 Shaima'a Freewan , Mostafa Hayajneh

In this paper we present new versions of the classical Brunn-Minkowski inequality for different classes of measures and sets. We show that the inequality \[ \mu(\lambda A + (1-\lambda)B)^{1/n} \geq \lambda \mu(A)^{1/n} +…

Probability · Mathematics 2015-07-10 Galyna Livshyts , Arnaud Marsiglietti , Piotr Nayar , Artem Zvavitch

Let $K=\{k_1,k_2,\ldots,k_r\}$ and $L=\{l_1,l_2,\ldots,l_s\}$ be disjoint subsets of $\{0,1,\ldots,p-1\}$, where $p$ is a prime and $A=\{A_1,A_2,\ldots,A_m\}$ be a family of subsets of $[n]$ such that $|A_i|\pmod{p}\in K$ for all $A_i\in A$…

Combinatorics · Mathematics 2017-01-04 Xin Wang , Hengjia Wei , Gennian Ge

Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…

Combinatorics · Mathematics 2021-05-04 Peter Frankl , Jian Wang

Let $t\geq 1$, let $A$ and $B$ be finite, nonempty subsets of an abelian group $G$, and let $A\pp{i} B$ denote all the elements $c$ with at least $i$ representations of the form $c=a+b$, with $a\in A$ and $b\in B$. For $|A|, |B|\geq t$, we…

Number Theory · Mathematics 2008-03-19 David J. Grynkiewicz

For finite sets A and B in the plane, we write A+B to denote the set of sums of the elements of A and B. In addition, we write tr(A) to denote the common number of triangles in any triangulation of the convex hull of A using the points of A…

Number Theory · Mathematics 2013-11-05 Karoly J. Boroczky , Benjamin Hoffman

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

For any pair of real numbers $(i,j)$ with $0<i,j<1$ and $i+j=1$, we prove that the set of $p$-adic mixed $(i,j)$-badly approximable numbers $\bad_p(i, j)$ is 1/2-winning in the sense of Schmidt's game. This improves a recent result of…

Number Theory · Mathematics 2013-12-06 Yaqiao Li

Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…

Combinatorics · Mathematics 2017-06-21 I. Bárány , E. Csóka , Gy. Károlyi , G. Tóth

The classical Brunn-Minkowski inequality states that for $A_1,A_2\subset\R^n$ compact, $$ |A_1+A_2|^{1/n}\ge |A_1|^{1/n}+|A_2|^{1/n}\eqno(1) $$ where $|\cdot|$ denotes the Lebesgue measure on $\R^n$. In 1986 V. Milman {\bf [Mil 1]}…

Functional Analysis · Mathematics 2016-09-06 Jesus Bastero , J. Bernues , A. Pena

Let $n>s>0$ be integers, $X$ an $n$-element set and $\mathscr{A}, \mathscr{B}\subset 2^X$ two families. If $|A\cup B|\le s$ for all $A\in\mathscr{A}, B\in \mathscr{B}$, then $\mathscr{A}$ and $\mathscr{B}$ are called cross $s$-union.…

Combinatorics · Mathematics 2021-04-06 Peter Frankl , Willie Wong H. W

The sum theorem and its corollaries are proved for a countable family of zero-dimensional (in the sense of small and large inductive bidimensions) p-closed sets, using a new notion of relative normality whose topological correspondent is…

General Topology · Mathematics 2007-06-29 B. P. Dvalishvili

A set $\{a_i\:|\: 1\leq i \leq k\}$ of non-negative integers is a Golomb ruler if differences $a_i-a_j$, for any $i \neq j$, are all distinct.All finite Sidon sets are Golomb rulers, and vice versa. A set of $I$ disjoint Golomb rulers (DGR)…

Combinatorics · Mathematics 2024-09-24 Xiaodong Xu , Baoxin Xiu , Changjun Fan , Meilian Liang

The BK inequality (\cite{BK85}) says that,for product measures on $\{0,1\}^n$, the probability that two increasing events $A$ and $B$ `occur disjointly' is at most the product of the two individual probabilities. The conjecture in…

Probability · Mathematics 2011-07-26 J. van den Berg , J. Jonasson

Let $X$ be an $n$--element finite set, $0<k\leq n/2$ an integer. Suppose that $\{A_1,A_2\} $ and $\{B_1,B_2\} $ are pairs of disjoint $k$-element subsets of $X$ (that is, $|A_1|=|A_2|=|B_1|=|B_2|=k$, $A_1\cap A_2=\emptyset$, $B_1\cap…

Combinatorics · Mathematics 2015-03-03 Bela Bollobas , Zoltan Furedi , Ida Kantor , G. O. H. Katona , Imre Leader

We show that for all $A, B \subseteq \{0,1,2\}^{d}$ we have $$ |A+B|\geq (|A||B|)^{\log(5)/(2\log(3))}. $$ We also show that for all finite $A,B \subset \mathbb{Z}^{d}$, and any $V \subseteq\{0,1\}^{d}$ the inequality $$ |A+B+V|\geq…

Combinatorics · Mathematics 2024-04-16 Lars Becker , Paata Ivanisvili , Dmitry Krachun , Jóse Madrid