中文
相关论文

相关论文: On the critical pair theory in Z/pZ

200 篇论文

A well-known result by Kemperman describes the structure of those pairs (A,B) of finite subsets of an abelian group satisfying |A+B|\le|A|+|B|-1. We establish a description which is, in a sense, dual to Kemperman's, and as an application…

数论 · 数学 2007-05-23 Vsevolod F. Lev

In this paper we prove that every set $A\subset\mathbb{Z}$ satisfying the inequality $\sum_{x}\min(1_A*1_A(x),t)\le(2+\delta)t|A|$ for $t$ and $\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use…

组合数学 · 数学 2015-06-02 Przemysław Mazur

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

数论 · 数学 2013-08-06 Renling Jin

We prove that a multiplicative subgroup $A_k$ of $\mathbb{Z}_p^*$ is a generalized arithmetic progression if and only if $|A_k| = 2,\ 4,$ or $p-1$. Much of the argument is built upon recent work studying additive decompositions of subgroups…

数论 · 数学 2026-02-05 Albert Cochrane

Let $(a,a+d,a+2d)$ be an arithmetic progression of positive integers. The following statements are proved: (1) If $a\mid 2d$, then $(a, a+d, a+2d)\in\mdeg(\Tame(\mathbb{C}^3))$. (2) If $a\nmid 2d$, then, except for arithmetic progressions…

交换代数 · 数学 2011-12-30 Jiantao Li , Xiankun Du

H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in…

组合数学 · 数学 2024-08-22 Dibyendu De , Pintu Debnath

We show that for a subset $A$ of the cyclic group of prime order $p>3$, if the sumset $A+A-2A$ is not the whole group, then $|A|\le \frac27\,p$. Besides combinatorial arguments, we utilize a general technique involving linear programming.

数论 · 数学 2025-10-21 Vsevolod Lev , Máté Matolcsi , Péter Pál Pach , Dániel Varga

Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term…

组合数学 · 数学 2007-05-23 Bruce Landman , Aaron Robertson

We examine the behavior of the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/n\mathbb{Z}$. We prove that if a set is chosen by including each element of $\mathbb{Z}/n\mathbb{Z}$ independently with constant…

组合数学 · 数学 2020-04-07 Ross Berkowitz , Ashwin Sah , Mehtaab Sawhney

We prove that any increasing sequence of real numbers with average gap $1$ and Poisson pair correlations has some gap that is at least $3/2+10^{-9}$. This improves upon a result of Aistleitner, Blomer, and Radziwill.

组合数学 · 数学 2025-03-05 Daniel Altman , Zachary Chase

Freiman's 2.4-Theorem states that any set $A \subset \mathbb{Z}_p$ satisfying $|2A| \leq 2.4|A| - 3 $ and $|A| < p/35$ can be covered by an arithmetic progression of length at most $|2A| - |A| + 1$. A more general result of Green and Ruzsa…

组合数学 · 数学 2018-06-01 Pablo Candela , Oriol Serra , Christoph Spiegel

We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient…

数论 · 数学 2017-06-02 Mario Ziller , John F. Morack

We show that for all $A, B \subseteq \{0,1,2\}^{d}$ we have $$ |A+B|\geq (|A||B|)^{\log(5)/(2\log(3))}. $$ We also show that for all finite $A,B \subset \mathbb{Z}^{d}$, and any $V \subseteq\{0,1\}^{d}$ the inequality $$ |A+B+V|\geq…

组合数学 · 数学 2024-04-16 Lars Becker , Paata Ivanisvili , Dmitry Krachun , Jóse Madrid

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

数论 · 数学 2016-11-21 Mei-Chu Chang

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such…

组合数学 · 数学 2017-06-07 Brian Cook , Ákos Magyar , Malabika Pramanik

We prove a quantitative local limit theorem for the number of descents in a random permutation. Our proof uses a conditioning argument and is based on bounding the characteristic function $\phi(t)$ of the number of descents. We also…

概率论 · 数学 2019-01-23 Bryce Cai , Annie Chen , Ben Heller , Eyob Tsegaye

In this paper, we consider associative algebras equipped with derivations. A pair consisting of an associative algebra and a distinguished derivation is called an AssDer pair. We study central extensions and formal one-parameter…

环与代数 · 数学 2025-10-14 Apurba Das , Ashis Mandal

We show that the twisted second moments of the Riemann zeta function averaged over the arithmetic progression $1/2 + i(an + b)$ with $a > 0$, $b$ real, exhibits a remarkable correspondance with the analogous continuous average and derive…

数论 · 数学 2012-08-14 Xiannan Li , Maksym Radziwill

We study $\nu_k(n)$, the number of partitions of $n$ into $k$ part sizes, and find numerous arithmetic progressions where $\nu_2$ and $\nu_3$ take on values divisible by 2 and 4. Expanding earlier work, we show $\nu_2(An+B) \equiv 0…

组合数学 · 数学 2016-05-05 William J. Keith

In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…

数论 · 数学 2022-10-04 Tsz Ho Chan