中文
相关论文

相关论文: Long arithmetic progressions in sumsets: Threshold…

200 篇论文

We show that every set $A$ of natural numbers with positive upper density can be shifted to contain the restricted sumset $\{b_1 + b_2 : b_1, b_2\in B \text{ and } b_1 \neq b_2 \}$ for some infinite set $B \subset A$.

动力系统 · 数学 2023-11-07 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We estimate the sizes of the sumset A + A and the productset A $\cdot$ A in the special case that A = S (x, y), the set of positive integers n less than or equal to x, free of prime factors exceeding y.

数论 · 数学 2010-10-19 William D. Banks , David Covert

In this paper, we consider the sum-product problem of obtaining lower bounds for the size of the set $$\frac{A+A}{A+A}:=\left \{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right\},$$ for an arbitrary finite set $A$ of real numbers. The…

组合数学 · 数学 2017-05-17 Oliver Roche-Newton

In this note we find the optimal lower bound for the size of the sumsets $HA$ and $H\,\hat{}A$ over finite sets $H, A$ of nonnegative integers, where $HA = \bigcup_{h\in H} hA$ and $H\,\hat{}A = \bigcup_{h\in H} h\,\hat{}A$. We also find…

组合数学 · 数学 2021-06-09 Jagannath Bhanja

The A-hierarchy is a parametric analogue of the polynomial hierarchy in the context of paramterised complexity theory. We give a new characterisation of the A-hierarchy in terms of a generalisation of the SUBSET-SUM problem.

计算机科学中的逻辑 · 计算机科学 2024-09-13 Jan Gutleben , Arne Meier

Let $A$ be a subset of primes up to $x$. If we assume $A$ is well-distributed (in the Siegel-Walfisz sense) in any arithmetic progressions to moduli $q\leqslant(\log x)^c$ for any $c>0$, then the sumset $A+A$ has density 1/2 in the natural…

数论 · 数学 2012-07-31 Ping Xi

We answer two questions of Kra, Moreira, Richter and Robertson regarding the existence of infinite sumsets of the form $B + C$ in dense and sparse sets of integers and the relation of sumsets to sets of recurrence. We then further…

动力系统 · 数学 2025-10-16 Luke Hetzel

A strictly increasing sequence $\mathscr{A}$ of positive integers is said to be primitive if no term of $\mathscr{A}$ divides any other. Erd\H{o}s showed that the series $\sum_{a \in \mathscr{A}} \frac{1}{a \log a}$, where $\mathscr{A}$ is…

数论 · 数学 2017-11-28 Bakir Farhi

A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…

数论 · 数学 2017-12-15 M. N. Huxley , M. C. Lettington , K. M. Schmidt

For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…

动力系统 · 数学 2024-04-22 Ioannis Kousek , Tristán Radić

We describe all sets $A \subseteq \F_p$ which represent the quadratic residues $R \subseteq \F_p$ as $R=A+A$ and $R=A\hat{+} A$. Also, we consider the case of an approximate equality $R \approx A+A$ and $R \approx A\hat{+} A$ and prove that…

数论 · 数学 2013-05-20 Ilya D. Shkredov

Suppose that G is an abelian group, A is a finite subset of G with |A+A|< K|A| and eta in (0,1] is a parameter. Our main result is that there is a set L such that |A cap Span(L)| > K^{-O_eta(1)}|A| and |L| = O(K^eta log |A|). We include an…

经典分析与常微分方程 · 数学 2018-11-05 Tom Sanders

For $\lambda \in \mathbb{Z}$, let $\lambda \cdot A = \{ \lambda a : a \in A\}$. Suppose $r, h\in \mathbb{Z}$ are sufficiently large and comparable to each other. We prove that if $|A+A| \le K |A|$ and $\lambda_1, \ldots, \lambda_h \le 2^r$,…

组合数学 · 数学 2017-08-29 Albert Bush , Yi Zhao

Given an array A containing arbitrary (positive and negative) numbers, we consider the problem of supporting range maximum-sum segment queries on A: i.e., given an arbitrary range [i,j], return the subrange [i' ,j' ] \subseteq [i,j] such…

数据结构与算法 · 计算机科学 2015-06-12 Pawel Gawrychowski , Patrick K. Nicholson

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

数论 · 数学 2023-01-03 Stefan Steinerberger

The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…

数论 · 数学 2022-06-10 F. Javier de Vega

Let K \subset L be a field extension. Given K-subspaces A,B of L, we study the subspace spanned by the product set AB = {ab | a \in A, b \in B}. We obtain some lower bounds on the dimension of this subspace and on dim B^n in terms of dim A,…

组合数学 · 数学 2021-08-19 Shalom Eliahou , Cédric Lecouvey

For a finite set $A\subseteq \mathbb{Z}$, the $h$-fold sumset is $hA :=\{x_1+\dots+x_h:x_i\in A\}$. We interpret the beginning of the sequence of sumset sizes $(|hA|)_{h=1}^\infty$ in terms of the successive $L^1$-minima of a lattice…

数论 · 数学 2025-08-19 Kevin O'Bryant

The study of sums of finite sets of integers has mostly concentrated on sets with small sumsets (Freiman's theorem and related work) and on sets with large sumsets (Sidon sets and $B_h$-sets). This paper considers the sets ${\mathcal…

数论 · 数学 2026-04-07 Melvyn B. Nathanson

We develop novel techniques which allow us to prove a diverse range of results relating to subset sums and complete sequences of positive integers, including solutions to several longstanding open problems. These include: solutions to the…

组合数学 · 数学 2021-05-03 David Conlon , Jacob Fox , Huy Tuan Pham