中文
相关论文

相关论文: Additive structures in sumsets

200 篇论文

We prove that if $B$ is a set of $N$ positive integers such that $B\cdot B$ contains an arithmetic progression of length $M$, then for some absolute $C > 0$, $$ \pi(M) + C \frac {M^{2/3}}{\log^2 M} \leq N, $$ where $\pi$ is the prime…

数论 · 数学 2016-10-18 Dmitrii Zhelezov

It was proved that whenever N is partitioned into finitely many cells, one cell must contain arbitrary length geo-arithmetic progressions. It was also proved that arithmetic and geometric progressions can be nicely intertwined in one cell…

组合数学 · 数学 2017-03-07 Tanushree Biswas

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

组合数学 · 数学 2010-04-13 Timothy D. LeSaulnier , Sujith Vijay

Since addition is commutative but subtraction is not, the sumset S+S of a finite set S is predisposed to be smaller than the difference set S-S. In this paper, however, we show that each of the three possibilities (|S+S|>|S-S|, |S+S|=|S-S|,…

数论 · 数学 2010-03-04 Greg Martin , Kevin O'Bryant

Given a closed ideal $I$ in a C*-algebra $A$, we show that $A$ is pure if and only if $I$ and $A/I$ are pure. More generally, we study permanence of comparison and divisibility properties when passing to extensions. As an application we…

算子代数 · 数学 2025-06-13 Francesc Perera , Hannes Thiel , Eduard Vilalta

Let $A$ be an infinite set of natural numbers. For $n\in \mathbb{N}$, let $r(A, n)$ denote the number of solutions of the equation $n=a+b$ with $a, b\in A, a\le b$. Let $|A(x)|$ be the number of integers in $A$ which are less than or equal…

数论 · 数学 2022-01-27 Yong-Gao Chen , Hui Lv

We show that for any finite set $A$ and an arbitrary $\varepsilon>0$ there is $k=k(\varepsilon)$ such that the higher energy ${\mathsf{E}}_k(A)$ is at most $|A|^{k+\varepsilon}$ unless $A$ has a very specific structure. As an application we…

数论 · 数学 2021-03-30 Ilya D. Shkredov

A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a…

数论 · 数学 2007-05-23 Terence Tao

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progression and such collection is also piecewise syndetic in Z. They used algebraic structure of beta N. The above result…

组合数学 · 数学 2019-09-27 Sayan Goswami , Subhajit Jana

We prove that if $A\subseteq \{1,\dots,N\}$ does not contain any non-trivial three-term arithmetic progression, then $$|A|\ll \frac{(\log\log N)^{3+o(1)}}{\log N}N\,.$$

数论 · 数学 2020-05-05 Tomasz Schoen

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

数论 · 数学 2013-04-26 Sándor Z. Kiss , Eszter Rozgonyi , Csaba Sándor

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

组合数学 · 数学 2025-09-03 Noga Alon , Huy Tuan Pham

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|…

组合数学 · 数学 2012-03-15 Gonzalo Fiz Pontiveros

Let $A$ be an artin algebra. The aim of this work is to describe the enlargements of an indecomposable complex in $\mathbf{C}_{n}(\mbox{proj} \,A)$, and to study the irreducible morphisms between them. Precisely, we prove that any…

表示论 · 数学 2025-09-17 Claudia Chaio , Alfredo Gonzalez Chaio , Pamela Suarez

We give a short proof of the fact that every set of natural numbers with positive upper Banach density contains the sum of two infinite sets. The approach simplifies earlier existing proofs.

动力系统 · 数学 2026-03-31 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We define two families of expansions of $(\mathbb{Z},+,0)$ by unary predicates, and prove that their theories are superstable of $U$-rank $\omega$. The first family consists of expansions $(\mathbb{Z},+,0,A)$, where $A$ is an infinite…

逻辑 · 数学 2020-05-22 Gabriel Conant

We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our…

数论 · 数学 2010-09-15 Steven J. Miller , Brooke Orosz , Daniel Scheinerman

We show that if A is a finite set of integers then it has a subset S of size \log^{1+c} |A| (c>0 absolute) such that s+s' is never in A when s and s' are distinct elements of S.

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

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

数论 · 数学 2024-09-20 Ali Alsetri , Xuancheng Shao

We show that if A is a subset of {1,...,N} contains no non-trivial three-term arithmetic progressions then |A|=O(N/ log^{1-o(1)} N). The approach is somewhat different from that used in arXiv:1007.5444.

经典分析与常微分方程 · 数学 2012-12-04 Tom Sanders