English
Related papers

Related papers: Few products, many h-fold sums

200 papers

The following extension of Bohr's theorem is established: If a somewhere convergent Dirichlet series $f$ has an analytic continuation to the half-plane $\mathbb{C}_\theta = \{s = \sigma+it\,:\, \sigma>\theta\}$ that maps $\mathbb{C}_\theta$…

Complex Variables · Mathematics 2023-11-03 Ole Fredrik Brevig , Athanasios Kouroupis

Let $\varepsilon>0$ be a fixed small constant, ${\mathbb F}_p$ be the finite field of $p$ elements for prime $p$. We consider additive and multiplicative problems in ${\mathbb F}_p$ that involve intervals and arbitrary sets. Representative…

Number Theory · Mathematics 2023-04-19 Moubariz Z. Garaev , Igor E. Shparlinski

We prove that for every $k$ and every $\varepsilon>0$, there exists $g$ such that every graph with tree-width at most $k$ and odd-girth at least $g$ has circular chromatic number at most $2+\varepsilon$.

Combinatorics · Mathematics 2009-04-16 Alexandr V. Kostochka , Daniel Kral' , Jean-Sebastien Sereni , Michael Stiebitz

For integers $k \geq 3$ and $r\geq 2$, we show that for every $\alpha> 0$, there exists $\varepsilon > 0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\alpha n$ and a binomial random…

Combinatorics · Mathematics 2022-11-07 Yulin Chang , Jie Han , Lubos Thoma

Let $A$ be a subset of an additive abelian semigroup $S$ and let $hA$ be the $h$-fold sumset of $A$. The following question is considered: Let $(A_q)_{q=1}^{\infty}$ be a strictly decreasing sequence of sets in $S$ and let $A =…

Number Theory · Mathematics 2026-05-15 Melvyn B. Nathanson

For k>=3 let A \subset [1,N] be a set not containing a solution to a_1 x_1+...+a_k x_k=a_1 x_{k+1}+...+a_k x_{2k} in distinct integers. We prove that there is an epsilon>0 depending on the coefficients of the equation such that every such A…

Number Theory · Mathematics 2015-06-26 Boris Bukh

A positive integer $n$ is called an abundant number if $\sigma (n)\ge 2n$, where $\sigma (n)$ is the sum of all positive divisors of $n$. Let $E(x)$ be the largest number of consecutive abundant numbers not exceeding $x$. In 1935, P. Erd\H…

Number Theory · Mathematics 2016-03-22 Yong-Gao Chen , Hui Lv

We prove that the product of a subset and a normal subset inside any finite simple non-abelian group $G$ grows rapidly. More precisely, if $A$ and $B$ are two subsets with $B$ normal and neither of them is too large inside $G$, then $|AB|…

Group Theory · Mathematics 2024-10-04 Daniele Dona , Attila Maróti , László Pyber

Let ${H}=(V, {E})$ be a hypergraph on the vertex set $V$ and edge set ${E}\subseteq 2^V$. We show that number of distinct {\it traces} on any $k-$ subset of $V$, is most $k.{\hat \alpha}(H)$, where ${\hat \alpha}(H)$ is the {\it degeneracy}…

Data Structures and Algorithms · Computer Science 2019-03-08 Farhad Shahrokhi

For an array $\left\{X_{n,j}, \, 1 \leqslant j \leqslant k_{n}, n \geqslant 1 \right\}$ of random variables and a sequence $\{c_{n} \}$ of positive numbers, sufficient conditions are given under which, for all $\varepsilon > 0$,…

Probability · Mathematics 2021-06-25 João Lita da Silva , Vanda Lourenço

We obtain a new lower bound on the largest Sidon subset of an arbitrary finite set of integers. If $H(n)$ denotes the minimum, over all $n$-element subsets of $\mathbb Z$, of the largest Sidon subset they contain, we prove that $H(n)…

Combinatorics · Mathematics 2026-05-06 Alexandre Bailleul , Robin Riblet

Given $0 < s < 1$, I prove that there exists a constant $\epsilon = \epsilon(s) > 0$ such that the following holds. Let $K \subset \mathbb{R}^{2}$ be a Borel set with $\mathcal{H}^{1}(K) > 0$, and let $E_{s}(K) \subset S^{1}$ be the…

Classical Analysis and ODEs · Mathematics 2016-11-15 Tuomas Orponen

We prove that there exists a constant $\varepsilon > 0$ with the following property: if $K \subset \mathbb{R}^{2}$ is a compact set which contains no pair of the form $\{x, x + (z, z^{2})\}$ for $z \neq 0$, then $\mathrm{dim}_\mathrm{H} K…

Classical Analysis and ODEs · Mathematics 2024-03-14 Borys Kuca , Tuomas Orponen , Tuomas Sahlsten

For every positive integer $n$, consider the linear operator $\U_{n}$ on polynomials of degree at most $d$ with integer coefficients defined as follows: if we write $\frac{h(t)}{(1 - t)^{d + 1}} = \sum_{m \geq 0} g(m) t^{m}$, for some…

Combinatorics · Mathematics 2010-09-01 Matthias Beck , Alan Stapledon

We show that \[\sum_{\substack{p_n\le x\\ p_{n+1}-p_n\ge\sqrt{p_n}}}(p_{n+1}-p_n)\ll_{\varepsilon} x^{3/5+\varepsilon}\] for any fixed $\varepsilon>0$. This improves a result of Matom\"{a}ki, in which the exponent was $2/3$.

Number Theory · Mathematics 2019-06-25 D. R. Heath-Brown

Given $h,g \in \mathbb{N}$, we write a set $X \subset \mathbb{Z}$ to be a $B_{h}^{+}[g]$ set if for any $n \in \mathbb{Z}$, the number of solutions to the additive equation $n = x_1 + \dots + x_h$ with $x_1, \dots, x_h \in X$ is at most…

Number Theory · Mathematics 2024-07-03 Yifan Jing , Akshat Mudgal

We show that if A is a set having small subtractive doubling in an abelian group, that is |A-A|< K|A|, then there is a polynomially large subset B of A-A so that the additive energy of B is large than (1/K)^{1 - \epsilon) where epsilon is a…

Combinatorics · Mathematics 2008-03-03 Nets Hawk Katz , Paul Koester

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are…

Combinatorics · Mathematics 2017-12-04 Brendan Murphy , Misha Rudnev , Ilya D. Shkredov , Yurii N. Shteinikov

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

Logic · Mathematics 2022-02-02 Alan Dow , Saharon Shelah

We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.

Number Theory · Mathematics 2007-05-23 Jozsef Solymosi