首页/论文/2012.14019

arXiv 2012.140192020-12-27math.NT

Gaps in the fractional parts of square roots

Simon Čopar

备注：: 14 pages, 6 figures

英文摘要：

Fractional parts of the first $N$ natural numbers fill the unit interval with asymptotically uniform density. However, the gaps around rational points shrink at an asymptotically lower rate $N^{-1/2}$, and their widths scale with the Thomae ("popcorn") function. This curious connection is derived and related geometrically to shadow pattern in the Euclid's orchard. Generalized cases of higher radicals and their convergence rates, are also investigated.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Gaps between fractional parts, and additive combinatorics

We give bounds on the number of distinct differences $N_a-a$ as $a$ varies over all elements of a given finite set $A$, and $N_a$ is a nearest neighbour to $a$.

2014-10-30math.NT

Bounded gaps between prime polynomials with a given primitive root

A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer $g$ is a primitive root, provided $g \neq -1$ and $g$ is not a perfect square. Thanks to work of Hooley, we know that this conjecture is true, conditional on the truth of the Generalized Riemann Hypothesis. Using a combination of Hooley's analysis and the techniques of Maynard-Tao used to prove the existence of bounded gaps between primes, Pollack has shown that (conditional on GRH) there are bounded gaps between primes with a prescribed primitive root. In the present article, we provide …

2015-04-15math.NT

On Gaps Between Primitive Roots in the Hamming Metric

We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure the distance in the Hamming metric and show that if $p$ is a sufficiently large $r$-bit prime, then for any integer $n \in [1,p]$ one can obtain a primitive root modulo $p$ by changing at most $0.11002786...r$ binary digits of $n$. This is stronger than what can be deduced from the Burgess result. Experimentally, the number of necessary bit changes is very sm…

2012-07-03math.NT

Bounded gaps between primes with a given primitive root

Fix an integer $g \neq -1$ that is not a perfect square. In 1927, Artin conjectured that there are infinitely many primes for which $g$ is a primitive root. Forty years later, Hooley showed that Artin's conjecture follows from the Generalized Riemann Hypothesis (GRH). We inject Hooley's analysis into the Maynard--Tao work on bounded gaps between primes. This leads to the following GRH-conditional result: Fix an integer $m \geq 2$. If $q_1 < q_2 < q_3 < \dots$ is the sequence of primes possessing $g$ as a primitive root, then $\liminf_{n\to\infty} (q_{n+(m-1)}-q_n) \leq C_m$, where $C_m$ is a f…

2014-05-05math.NT

Bounded gaps between primes with a given primitive root, II

Let $m$ be a natural number, and let $\mathcal{Q}$ be a set containing at least $\exp(C m)$ primes. We show that one can find infinitely many strings of $m$ consecutive primes each of which has some $q\in\mathcal{Q}$ as a primitive root, all lying in an interval of length $O_{\mathcal{Q}}(\exp(C'm))$. This is a bounded gaps variant of a theorem of Gupta and Ram Murty. We also prove a result on an elliptic analogue of Artin's conjecture. Let $E/\mathbb{Q}$ be an elliptic curve with an irrational $2$-torsion point. Assume GRH. Then for every $m$, there are infinitely many strings of $m$ consecut…

2014-07-27math.NT

On the fractional parts of roots of positive real numbers

Let [θ] denote the integer part and θ the fractional part of the real number θ. For θ> 1 and {θ^{1/n}} \neq 0, define M_θ(n) = [1/{θ^{1/n}}]. The arithmetic function M_θ(n) is eventually increasing, and \lim_{n\rightarrow \infty} M_θ(n)/n = 1/\log θ. Moreover, M_θ(n) is "linearly periodic" if and only if \log θis rational. Other results and problems concerning the function M_θ(n) are discussed.

2013-04-12math.NT

更多相关论文收起更多论文

关于分式理想的标准根

On canonical roots of fractional ideals

Centrum Wiskunde & Informatica（数学与计算机科学中心）

研究如何在多项式时间内计算序$R$的分式理想的根，因不假定$R$是戴德金的，输出不唯一，故要求算法具函子性，通过推广相关结果来满足这两个约束。

2026-07-22math.NT

线性形式分数部分间隙的界

Bounds on the gaps in the fractional parts of a linear form

本文研究线性形式分数部分集合中广义间隙大小的上界，针对通用参数和足够大的Q，并引入一个独立的丢番图逼近问题。

2025-02-26math.DSmath.NT

A forest of linear fractional transformations

The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. For every $2\times 2$ matrix with nonnegative integral coordinates and nonzero determinant, it is possible to construct an analogous tree with this root. If the root is the identity matrix, then the tree consists all matrices with determinant 1, and this tree possesses the basic properties of the Calkin-Wilf tree of positive rational numbers. The set of all matrices with…

2014-06-04math.NT

根的分数部分序列

The sequence of fractional parts of roots

College of Staten Island (CUNY)（石溪学院（CUNY））；CUNY Graduate Center（CUNY研究生院）

本文研究了根的分数部分序列，证明了在不考虑t条件的情况下，几乎所有整数n满足特定的渐进行为，并利用连分数构造了具有不同例外性质的t。

2015-06-09math.NT

Properties of the Digital Root and its Extension to Rational Numbers -- an Algebraic Approach

This paper contains an algebraic constructive and self-contained account of the invariance rule of the digital root under division for an arbitrary natural basis representation. Both the cases of repeating and non-repeating fractionals are treated. In the preliminary section some known results such as the uniqueness in the representation of a fraction are discussed for both the finite and infinite bases cases. Simple examples are introduced throughout the text for illustrative purposes.

2021-10-07math.NT

Gaps between logs

We calculate the limiting gap distribution for the fractional parts of log n, where n runs through all positive integers. By rescaling the sequence, the proof quickly reduces to an argument used by Barra and Gaspard in the context of level spacing statistics for quantum graphs. The key ingredient is Weyl equidistribution of irrational translations on multi-dimensional tori. Our results extend to logarithms with arbitrary base; we deduce explicit formulas when the base is transcendental or the r:th root of an integer. If the base is close to one, the gap distribution is close to the exponential…

2013-01-07math.NT

Higher dimensional Steinhaus and Slater problems via homogeneous dynamics

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $α,2α,\ldots, Nα$ take at most three distinct values. Motivated by a question of Erdős, Geelen and Simpson, we explore a higher-dimensional variant, which asks for the number of gaps between the fractional parts of a linear form. Using the ergodic properties of the diagonal action on the space of lattices, we prove that for almost all parameter values the number of distinct gaps in the higher dimensional problem is unbounded. Our results in particular improve…

2018-07-10math.COmath.DSmath.NT

The two-point correlation function of the fractional parts of \sqrt{n} is Poisson

Elkies and McMullen [Duke Math.J.~123 (2004) 95--139] have shown that the gaps between the fractional parts of \sqrt n for n=1,\ldots,N, have a limit distribution as N tends to infinity. The limit distribution is non-standard and differs distinctly from the exponential distribution expected for independent, uniformly distributed random variables on the unit interval. We complement this result by proving that the two-point correlation function of the above sequence converges to a limit, which in fact coincides with the answer for independent random variables. We also establish the convergence o…

2013-06-27math.DSmath.NT