中文
相关论文

相关论文: On Non-intersecting Arithmetic Progressions

200 篇论文

The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic…

数论 · 数学 2014-02-26 Daniel Fiorilli

We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…

We obtain explicit forms of the current best known asymptotic upper bounds for gaps between squarefree integers. In particular we show, for any $x \ge 2$, that every interval of the form $(x, x + 11x^{1/5}\log x]$ contains a squarefree…

Let $x_1,\dots,x_{n}$ be a fixed sequence of real numbers. At each stage, pick $k$ integers $\{I_{i}\}_{1\leq i \leq k}$ uniformly at random without replacement and then for each $i \in \{1,2,\dots,k\}$ replace $x_{I_i}$ by…

概率论 · 数学 2026-02-18 Rohit Chaudhuri

In 1946, Behrend gave a construction of dense finite sets of integers that do not contain 3-term arithmetic progressions. In 1961, Rankin generalized Behrend's construction to sets avoiding k-term arithmetic progressions, and in 2008 Elkin…

数论 · 数学 2010-06-22 Kevin O'Bryant

We consider, over both the integers and finite fields, Szemer\'{e}di's theorem on $k$-term arithmetic progressions where the set $S$ of allowed common differences in those progressions is restricted and random. Fleshing out a line of…

数论 · 数学 2019-11-01 Daniel Altman

We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…

数论 · 数学 2012-03-15 Henry Cohn

We study mean convergence of multiple ergodic averages, where the iterates arise from smooth functions of polynomial growth that belong to a Hardy field. Our results include all logarithmico-exponential functions of polynomial growth, such…

动力系统 · 数学 2023-03-13 Konstantinos Tsinas

We prove that a point $x$ is normal with respect to an ergodic, number-theoretic transformation $T$ if and only if $x$ is normal with respect to $T^n$ for any $n\ge 1$. This corrects an erroneous proof of Schweiger. Then, using some…

数论 · 数学 2014-08-05 Joseph Vandehey

Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…

数论 · 数学 2016-01-27 Roger C. Baker , Liangyi Zhao

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

数论 · 数学 2007-05-23 Zhi-Wei Sun

In this paper, it is proved that there is an arithmetic progression of positive integers such that each of which is expressible neither as $p+F_m$ nor as $q+L_n$, where $ p,q $ are primes, $ F_m $ denotes the $ m $-th Fibonacci number and $…

综合数学 · 数学 2025-06-17 Rui-Jing Wang

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

数论 · 数学 2024-04-02 Siddharth Iyer

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

数论 · 数学 2007-05-23 Thomas Garrity

Let $i(n,k)$ be the proportion of permutations $\pi\in\mathcal{S}_n$ having an invariant set of size $k$. In this note we adapt arguments of the second author to prove that $i(n,k) \asymp k^{-\delta} (1+\log k)^{-3/2}$ uniformly for $1\leq…

组合数学 · 数学 2019-10-22 Sean Eberhard , Kevin Ford , Ben Green

We prove that the gcd of certain infinite number of integers associated to generalised arithmetic progressions remains bounded independent of the progression. Using this we also get bounds on the indices of certain congruence subgroups of…

数论 · 数学 2007-05-23 T. N. Venkataramana

In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some additional results.

组合数学 · 数学 2019-01-21 James Currie , Tero Harju , Pascal Ochem , Narad Rampersad

Let N^{+}(k)= 2^{k/2} k^{3/2} f(k) and N^{-}(k)= 2^{k/2} k^{1/2} g(k) where 1=o(f(k)) and g(k)=o(1). We show that the probability of a random 2-coloring of {1,2,...,N^{+}(k)} containing a monochromatic k-term arithmetic progression…

组合数学 · 数学 2012-06-07 Sujith Vijay

We obtain asymptotic results on the average numbers of Goldbach representations of an interger as the sum of two primes in different arithmetic progressions. We also prove an omega-result showing that the asymptotic result is essentially…

数论 · 数学 2025-05-02 Thi Thu Nguyen

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

数论 · 数学 2025-09-25 Le Duc Hieu