相关论文: Long Arithmetic Progressions in Critical Sets

Let H stand for the set of homeomorphisms on [0,1]. We prove the following dichotomy for Borel subsets A of [0,1]: either there exists a homeomorphism f in H such that the image f(A) contains no 3-term arithmetic progressions; or, for every…

We establish discorrelation estimates between the Piatetski-Shapiro prime set \[ \mathcal{P}_{\gamma} := \{p \text{ is prime and } p = \lfloor n^{1/\gamma} \rfloor \text{ for some } n \in \mathbb{N}\} \] and arbitrary nilsequences when…

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

We prove that the dimension of the $\mathbb{Q}$-linear span of $1,\zeta(3),\zeta(5),\ldots,\zeta(s-1)$ is at least $(1.119 \cdot \log s)/(1+\log 2)$ for any sufficiently large even integer $s$. This slightly refines a well-known result of…

For an integer $b\geq 2$, we call a positive integer $b$-anti-Niven if it is relatively prime to the sum of the digits in its base-$b$ representation. In this article, we investigate the maximum lengths of arithmetic progressions of…

Let $X$ be a sufficiently large positive integer. We prove that one may choose a subset $S$ of primes with cardinality $O(\log X)$, such that a positive proportion of integers less than $X$ can be represented by $x^2 + p y^2$ for at least…

In this note, we study the problem of existence of sequences of consecutive 1's in the periodic part of the continued fractions expansions of square roots of primes. We prove unconditionally that, for a given $N\gg 1$, there are at least…

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L containing n positive integers not exceeding n there exists a near 1-factor in K_p whose list of edge-lengths is L. In this paper we propose a generalization of this…

The arithmetic partial derivative (with respect to a prime $p$) is a function from the set of integers that sends $p$ to 1 and satisfies the Leibniz rule. In this paper, we prove that the $p$-adic valuation of the sequence of higher order…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

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…

Let p be a prime, and let f : Z/pZ -> R be a function with average value 0 and ||f||_A <= 1, where ||f||_A denotes the algebra norm (L^1 norm of the Fourier transform). Then f(x) is small for some x, specifically min_x |f(x)| is no more…

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

We investigate a restriction of Paul Erdos' well-known problem from 1936 on the discrepancy of homogeneous arithmetic progressions. We restrict our attention to a finite set S of homogeneous arithmetic progressions, and ask when the…

Let $p_n$ be the $n$th prime, and consider the sequence $s_n = (2\cdot3\cdots p_n)^{1/n} = (p_n\#)^{1/n}$, the geometric mean of the first $n$ primes. We give a short proof that $p_n/s_n \to e$, a result conjectured by Vrba (2010) and…

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

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…