English
Related papers

Related papers: If $(A+A)/(A+A)$ is small then the ratio set is la…

200 papers

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

Dynamical Systems · Mathematics 2025-04-14 Dimitrios Charamaras , Ioannis Kousek , Andreas Mountakis , Tristán Radić

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

Combinatorics · Mathematics 2007-05-23 Van Vu

We develop various lower bounds for the numerical radius $w(A)$ of a bounded linear operator $A$ defined on a complex Hilbert space, which improve the existing inequality $w^2(A)\geq \frac{1}{4}\|A^*A+AA^*\|$. In particular, for $r\geq 1$,…

Functional Analysis · Mathematics 2024-08-14 Pintu Bhunia , Suvendu Jana , Mohammad Sal Moslehian , Kallol Paul

A set of integers $A$ is non-averaging if there is no element $a$ in $A$ which can be written as an average of a subset of $A$ not containing $a$. We show that the largest non-averaging subset of $\{1, \ldots, n\}$ has size $n^{1/4+o(1)}$,…

Combinatorics · Mathematics 2025-09-11 Huy Tuan Pham , Dmitrii Zakharov

We find nearly the optimal size of a set $A\subset [N] := \{1,...,N\}$ so that the product set $AA$ satisfies either (i) $|AA| \sim |A|^2/2$ or (ii) $|AA| \sim |[N][N]|$. This settles problems raised in a recent article of Cilleruelo,…

Number Theory · Mathematics 2019-10-22 Kevin Ford

Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher…

Combinatorics · Mathematics 2018-06-20 G. Shakan , I. D. Shkredov

Resolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting. Denoted Res(lin_R), this refutation system operates with disjunctions of linear…

Computational Complexity · Computer Science 2019-11-19 Fedor Part , Iddo Tzameret

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

Let $G$ be a $p$-group for some prime $p$. Let $n$ be the positive integer so that $|G:Z(G)| = p^n$. Suppose $A$ is a maximal abelian subgroup of $G$. Let $$p^l = {\rm max} \{|Z(C_G (g)):Z(G)| : g \in G \setminus Z(G)\},$$ $$p^b = {\rm max}…

Group Theory · Mathematics 2024-02-20 Mark L. Lewis

The best bounds of the form $B(\alpha,\beta,\gamma,x)=(\alpha+\sqrt{\beta^2+\gamma^2 x^2})/x$ for ratios of modified Bessel functions are characterized: if $\alpha$, $\beta$ and $\gamma$ are chosen in such a way that…

Classical Analysis and ODEs · Mathematics 2023-04-17 J. Segura

Let $F$ be a field of characteristic $p>2$ and $A\subset F$ have sufficiently small cardinality in terms of $p$. We improve the state of the art of a variety of sum-product type inequalities. In particular, we prove that $$ |AA|^2|A+A|^3…

Combinatorics · Mathematics 2015-12-22 Esen Aksoy Yazici , Brendan Murphy , Misha Rudnev , Ilya Shkredov

Let $A$ be a finite set of positive real numbers. We present a sum-division estimate: |A+A|^2|A/A|\geq\frac{|A|^4}{4}.

Number Theory · Mathematics 2009-05-16 Liangpan Li , Jian Shen

A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…

Combinatorics · Mathematics 2019-02-20 Tom Eccles

We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac{\pi}{3} + c$, has size $(1+\Theta(c))^d$ for sufficiently small $c>0$. The proof is based on a refinement of an approach by Erd\H{o}s and…

Combinatorics · Mathematics 2022-07-18 Miroslav Marinov

The multiplicity (resp. degree) of a function $f$ relative to a semianalytic subset $S$ of $\mathbb{R}^n$ is the greatest (resp. smallest) exponent among numbers $j$ such that the inequality $|f(x)|\leq C\|x\|^j$ holds on $S$ near $0$…

Algebraic Geometry · Mathematics 2019-10-14 Vincent Grandjean , Maria Michalska

We consider the problem of sums of dilates in groups of prime order. We show that given $A\subset \Z{p}$ of sufficiently small density then $$\big| \lambda_{1}A+\lambda_{2}A+...+ \lambda_{k}A \big|…

Combinatorics · Mathematics 2012-03-15 Gonzalo Fiz Pontiveros

For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. In this paper, for a sequence of integers $B=\{1<b_1<b_2<\cdots\}$ and $3b_1+5\leq b_2\leq 6b_1+10$, we determine the critical value for $b_3$ such that there exists an…

Number Theory · Mathematics 2020-05-20 Min Tang , Hongwei Xu

We study pairs of subsets $A, B$ of a compact abelian group $G$ where the sumset $A+B:=\{a+b: a\in A, b\in B\}$ is small. Let $m$ and $m_{*}$ be Haar measure and inner Haar measure on $G$, respectively. Given $\varepsilon>0$, we classify…

Combinatorics · Mathematics 2019-11-28 John T. Griesmer

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg…

Combinatorics · Mathematics 2016-11-17 Antal Balog , Oliver Roche-Newton , Dmitry Zhelezov