中文
相关论文

相关论文: k-term Arithmetic Progressions in Sumsets

200 篇论文

If $M$ is a set of nonsingular $k\times k$ matrices then for many pairs of matrices, $A,B\in M,$ the sum is nonsingular, $\det(A+B)\neq 0.$ We prove a more general statement on nonsingular sums with an application.

组合数学 · 数学 2018-02-22 Jozsef Solymosi

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. The representation function $R_{A,k}(n)$ for the set $A$ is the number of representations of a nonnegative integer $n$ as the sum of $k$ terms from $A$. Let $A(n)$…

数论 · 数学 2023-03-03 Sándor Z. Kiss , Csaba Sándor , Quan-Hui Yang

In this note we are interested in the problem of whether or not every increasing sequence of positive integers $x_1x_2x_3...$ with bounded gaps must contain a double 3-term arithmetic progression, i.e., three terms $x_i$, $x_j$, and $x_k$…

组合数学 · 数学 2013-11-19 Tom Brown , Veselin Jungić , Andrew Poelstra

For integers $m$ and $n$, we study the problem of finding good lower bounds for the size of progression-free sets in $(\mathbb{Z}_{m}^{n},+)$. Let $r_{k}(\mathbb{Z}_{m}^{n})$ denote the maximal size of a subset of $\mathbb{Z}_{m}^{n}$…

数论 · 数学 2023-01-02 Christian Elsholtz , Benjamin Klahn , Gabriel F. Lipnik

Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is…

组合数学 · 数学 2019-05-08 Aninda Chakraborty , Sayan Goswami

In this paper, we evaluate some series of the form $$\sum_{k=1}^\infty\frac{ak^2+bk+c}{k(3k-1)(3k-2)m^k\binom{4k}k}.$$ For example, we prove that $$\sum_{k=1}^\infty\frac{(5k^2-4k+1)8^{k}}{k(3k-1)(3k-2)\binom{4k}k}=\frac{3}2\pi$$ and…

数论 · 数学 2026-02-09 Zhi-Wei Sun

We study arithmetic progressions $\{a,a+b,a+2b,\dots,a+(\ell-1) b\}$, with $\ell\ge 3$, in random subsets of the initial segment of natural numbers $[n]:=\{1,2,\dots, n\}$. Given $p\in[0,1]$ we denote by $[n]_p$ the random subset of $[n]$…

概率论 · 数学 2019-02-13 Yacine Barhoumi-Andréani , Christoph Koch , Hong Liu

Let N be a large enough natural number, A and B be subsets of {N+1, ... , 2N}. In this paper, we prove that there exists integers a, b with a belongs to A, b belongs to B such that ab=P_k^2 + O(P_k^{1-c}), where 0<c<1/2 and P_k denotes an…

数论 · 数学 2024-11-26 Yuetong Zhao , Wenguang Zhai

Let $E\subset\rr$ be a closed set of Hausdorff dimension $\alpha$. We prove that if $\alpha$ is sufficiently close to 1, and if $E$ supports a probabilistic measure obeying appropriate dimensionality and Fourier decay conditions, then $E$…

经典分析与常微分方程 · 数学 2013-06-11 Izabella Laba , Malabika Pramanik

Let $\text{ac}(n,k)$ denote the smallest positive integer with the property that there exists an $n$-colouring $f$ of $\{1,\dots,\text{ac}(n,k)\}$ such that for every $k$-subset $R \subseteq \{1, \dots, n\}$ there exists an (arithmetic)…

组合数学 · 数学 2018-02-12 Leonardo Alese , Stefan Lendl , Paul Tabatabai

Given $m \in \mathbb{N}$ and a $p$-random subset $A \subseteq \mathbb{N}$, we asymptotically determine $\log \Pr(|\mathbb{N} \setminus (A + A)| \ge m)$ for $p$ above the threshold for this property. The proof is based on a bespoke container…

组合数学 · 数学 2026-05-29 Rajko Nenadov , Lander Verlinde

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

经典分析与常微分方程 · 数学 2009-12-30 Chun-Yen Shen

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

数论 · 数学 2022-11-21 Joerg Bruedern , Trevor D. Wooley

It is shown that the previously known $N=3$ and $N=4$ superconformal algebras can be contracted consistently by singular scaling of some of the generators. For the later case, by a contraction which depends on the central term, we obtain a…

高能物理 - 理论 · 物理学 2015-06-26 Abbas Ali , Alok Kumar

More than twenty years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for any integers $n, k$ satisfying $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum…

组合数学 · 数学 2011-08-09 Noga Alon , Hao Huang , Benny Sudakov

Let $G$ be an additive finite abelian group of order $n$, and let $S$ be a sequence of $n+k$ elements in $G$, where $k\geq 1$. Suppose that $S$ contains $t$ distinct elements. Let $\sum_n(S)$ denote the set that consists of all elements in…

数论 · 数学 2013-08-13 Xingwu Xia , Weidong Gao

Suppose that $A$, $B$ and $S$ are non-empty subsets of a finite abelian group $G$. Then the generalized restricted sumset $$ A\stackrel{S}+B:=\{a+b:\,a\in A,\ b\in B,\ a-b\not\in S\} $$ contains at least $$ \min\{|A|+|B|-3|S|,p(G)\} $$…

数论 · 数学 2016-09-13 Shanshan Du , Hao Pan

We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…

组合数学 · 数学 2014-12-01 Mauro Di Nasso

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

组合数学 · 数学 2014-08-13 Tomasz Schoen , Olof Sisask

We prove a generalisation of Roth's theorem for arithmetic progressions to d-configurations, which are sets of the form {n_i+n_j+a}_{1 \leq i \leq j \leq d} where a, n_1,..., n_d are nonnegative integers, using Roth's original density…

数论 · 数学 2012-11-15 Jehanne Dousse