中文
相关论文

相关论文: Arithmetic progressions consisting of unlike power…

200 篇论文

We introduce a class of convolutions on arithmetical functions that are regular in the sense of of Narkiewicz, homogeneous in the sense of Burnett et al, and bounded, in the sense that there exists a common finite bound for the rank of…

数论 · 数学 2025-04-30 Jan Snellman

Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…

组合数学 · 数学 2020-08-10 Jacob Fox , Cosmin Pohoata

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

数论 · 数学 2021-05-28 Jianya Liu , Lilu Zhao

Let $p$ be a prime number, and $h$ a positive integer such that $\gcd(p,h)=1$. We prove, without invoking Dirichlet's theorem, that the arithmetic progression $p\left(\mathbf{N}\cup \{0\}\right)+h$ contains infinitely many prime numbers.…

综合数学 · 数学 2023-11-21 Jhixon Macías

We obtain a generalization of the recent Kelley--Meka result on sets avoiding arithmetic progressions of length three. In our proof we develop the theory of the higher energies. Also, we discuss the case of longer arithmetic progressions,…

数论 · 数学 2023-04-11 Ilya D. Shkredov

In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…

数论 · 数学 2009-01-29 Zhi-Wei Sun

In this paper we give a very elementary proof that if A and B are subsets of {1,2,...,N}, each having at least 5N^{1 - (4(k-1))^{-1}} elements, then the sumset A+B has a k-term arithmetic progression.

数论 · 数学 2007-05-23 Ernie Croot

We show that there is a positive constant $c$ such that any graph on vertex set $[n]$ with at most $c n^2/k^2 \log k$ edges contains an independent set of order $k$ whose vertices form an arithmetic progression. We also present applications…

组合数学 · 数学 2019-01-17 David Conlon , Jacob Fox , Benny Sudakov

In this note we announce the proof of the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s => 3; this is new for s => 4, the cases s = 1,2,3 having been previously established. More precisely we outline a proof (details of which…

数论 · 数学 2011-05-31 Ben Green , Terence Tao , Tamar Ziegler

In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed…

数论 · 数学 2017-03-16 Szabolcs Tengely

In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.

群论 · 数学 2020-03-24 Marius Tărnăuceanu

We realize any submultiplicative increasing function which is equivalent to a polynomial proportion of itself as the growth function of a finitely generated simple Lie algebra. As an application, we resolve two open problems posed by…

环与代数 · 数学 2020-07-07 Be'eri Greenfeld

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

数论 · 数学 2007-05-23 Nils Hebbinghaus

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

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

数论 · 数学 2024-10-30 Zander Kelley , Raghu Meka

In a recent breakthrough Kelley and Meka proved a quasipolynomial upper bound for the density of sets of integers without non-trivial three-term arithmetic progressions. We present a simple modification to their method that strengthens…

数论 · 数学 2023-09-06 Thomas F. Bloom , Olof Sisask

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

组合数学 · 数学 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…

数论 · 数学 2020-07-14 Corentin Darreye

We study the distribution of consecutive sums of two squares in arithmetic progressions. If $\{E_n\}_{n \in \mathbb{N}}$ is the sequence of sums of two squares in increasing order, we show that for any modulus $q$ and any congruence classes…

数论 · 数学 2024-11-26 Noam Kimmel , Vivian Kuperberg

Given $k, \ell \in {\bf N}^+$, let $x_{i,j}$ be, for $1 \le i \le k$ and $0 \le j \le \ell$, some fixed integers, and define, for every $n \in {\bf N}^+$, $s_n := \sum_{i=1}^k \prod_{j=0}^\ell x_{i,j}^{n^j}$. We prove that the following are…

数论 · 数学 2018-05-15 Paolo Leonetti , Salvatore Tringali