Searcharxiv⌕ Search

arXiv subjects

Joseph Vandehey

Publications and source records attributed to Joseph Vandehey.

At least 37 records · Page 2Linked to original sources

Intrinsic Diophantine approximation in Carnot groups and in the Siegel model of the Heisenberg group

We initiate the study of an intrinsic notion of Diophantine approximation on a rational Carnot group $G$. If $G$ has Hausdorff dimension $Q$, we show that its Diophantine exponent is equal to $(Q+1)/Q$, generalizing the case $G=\mathbb R^n$. We furthermore obtain a precise asymptotic on the count of rational approximations. We then focus on the case of the Heisenberg group $\mathbb H^n$, distinguishing between two notions of Diophantine approximation by rational points in $\mathbb H^n$: Carnot Diophantine approximation and Siegel Diophantine approximation. After computing the Siegel Diophantine exponent (surprisingly, equal to 1 for all $\mathbb H^n$), we consider Siegel-badly approximable points to show that Siegel approximation is linked to both Heisenberg continued fractions and to geodesics in complex hyperbolic space. We conclude by showing that Carnot and Siegel approximation are qualitatively different: Siegel-badly approximable points are Schmidt winning in any complete Ahlfors regular subset of $\mathbb H^n$, while the set of Carnot-badly approximable points does not have this property.

math.NT↗

Continued fraction normality is not preserved along arithmetic progressions

It is well known that if $0.a_1a_2a_3\dots$ is the base-$b$ expansion of a number normal to base-$b$, then the numbers $0.a_ka_{m+k}a_{2m+k}\dots$ for $m\ge 2$, $k\ge 1$ are all normal to base-$b$ as well. In contrast, given a continued fraction expansion $\langle a_1,a_2,a_3,\dots\rangle$ that is normal (now with respect to the continued fraction expansion), we show that for any integers $m\ge 2$, $k\ge 1$, the continued fraction $\langle a_k, a_{m+k},a_{2m+k},a_{3m+k},\dots\rangle$ will never be normal.

math.NT↗

New normality constructions for continued fraction expansions

Adler, Keane, and Smorodinsky showed that if one concatenates the finite continued fraction expansions of the sequence of rationals \[ \frac{1}{2}, \frac{1}{3}, \frac{2}{3}, \frac{1}{4}, \frac{2}{4}, \frac{3}{4}, \frac{1}{5}, \cdots \] into an infinite continued fraction expansion, then this new number is normal with respect to the continued fraction expansion. We show a variety of new constructions of continued fraction normal numbers, including one generated by the subsequence of rationals with prime numerators and denominators: \[ \frac{2}{3}, \frac{2}{5}, \frac{3}{5}, \frac{2}{7}, \frac{3}{7}, \frac{5}{7},\cdots. \]

math.NT↗

Non-trivial matrix actions preserve normality for continued fractions

A seminal result due to Wall states that if $x$ is normal to a given base $b$ then so is $rx+s$ for any rational numbers $r,s$ with $r\neq 0$. We show that a stronger result is true for normality with respect to the continued fraction expansion. In particular, suppose $a,b,c,d\in \mathbb{Z}$ with $ad-bc\neq 0$. Then if $x$ is continued fraction normal, so is $(ax+b)/(cx+d)$.

math.NT↗

Normal number constructions for Cantor series with slowly growing bases

Let $Q=(q_n)_{n=1}^\infty$ be a sequence of bases with $q_i\ge 2$. In the case when the $q_i$ are slowly growing and satisfy some additional weak conditions, we provide a construction of a number whose $Q$-Cantor series expansion is both $Q$-normal and $Q$-distribution normal. Moreover, this construction will result in a computable number provided we have some additional conditions on the computability of $Q$, and from this construction we can provide computable constructions of numbers with atypical normality properties.

math.NT↗

Diophantine properties of continued fractions on the Heisenberg group

We provide several results on the diophantine properties of continued fractions on the Heisenberg group, many of which are analogous to classical results for real continued fractions. In particular, we show an analog of Khinchin's theorem and that convergents are also best approximants up to a constant factor of the denominator.

math.NT↗

On the joint normality of certain digit expansions

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 insights from Schweiger's original proof, we extend these results, showing for example that a number is normal with respect to the regular continued fraction expansion if and only if it is normal with respect to the odd continued fraction expansion.

math.NT↗

Normality preserving operations for Cantor series expansions and associated fractals part II

We investigate how non-zero rational multiplication and rational addition affect normality with respect to $Q$-Cantor series expansions. In particular, we show that there exists a $Q$ such that the set of real numbers which are $Q$-normal but not $Q$-distribution normal, and which still have this property when multiplied and added by rational numbers has full Hausdorff dimension. Moreover, we give such a number that is explicit in the sense that it is computable.

math.NT↗

Besicovitch, Bisection, and the normality of $0.(1)(4)(9)(16)(25)\dots$

We revisit Besicovitch's 1935 paper in which he introduced several techniques that have become essential elements of modern combinatorial methods of normality proofs. Despite his paper's influence, the results he inspired are not strong enough to reprove his original result. We provide a new proof of the normality of the constant $0.(1)(4)(9)(16)(25)\dots$ formed by concatenating the squares, updating Besicovitch's methods.

math.NT↗

A simpler normal number construction for simple Luroth series

Champernowne famously proved that the number $0.(1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)...$ formed by concatenating all the integers one after another is normal base 10. We give a generalization of Champernowne's construction to various other digit systems, including generalized Lüroth series with a finite number of digits. For these systems, our construction simplifies a recent construction given by Madritsch and Mance. Along the way we give an estimation of the sum of multinomial coefficients above a tilted hyperplane in Pascal's simplex, which may be of general interest.

math.NT↗

Some normal numbers generated by arithmetic functions

Let $g \geq 2$. A real number is said to be g-normal if its base g expansion contains every finite sequence of digits with the expected limiting frequency. Let ϕdenote Euler's totient function, let σbe the sum-of-divisors function, and let λbe Carmichael's lambda-function. We show that if f is any function formed by composing ϕ, σ, or λ, then the number \[ 0. f(1) f(2) f(3) \dots \] obtained by concatenating the base g digits of successive f-values is g-normal. We also prove the same result if the inputs 1, 2, 3, \dots are replaced with the primes 2, 3, 5, \dots. The proof is an adaptation of a method introduced by Copeland and Erdos in 1946 to prove the 10-normality of 0.235711131719\ldots.

math.NT↗

Continued fractions on the Heisenberg group

We provide a generalization of continued fractions to the Heisenberg group. We prove an explicit estimate on the rate of convergence of the infinite continued fraction and several surprising analogs of classical formulas about continued fractions. We then discuss dynamical properties of the associated Gauss map, comparing them with base-$b$ expansions on the Heisenberg group and continued fractions on the complex plane.

math.NT↗

The normality of digits in almost constant additive functions

We consider numbers formed by concatenating some of the base b digits from additive functions f(n) that closely resemble the prime counting function Ω(n). If we concatenate the last \lceil y \frac{\log \log \log n}{\log b} \rceil digits of each f(n) in succession, then the number so created will be normal if and only if 0 < y \le 1/2. This provides insight into the randomness of digit patterns of additive function after the Erdos-Kac theorem becomes ineffective.

math.NT↗

Error term improvements for van der Corput transforms

We improve the error term in the van der Corput transform for exponential sums \sum_{a \le n \le b} g(n) exp(2πi f(n)). For many functions g and f, we can extract the next term in the asymptotic, showing that previous results, such as those of Karatsuba and Korolev, are sharp. Of particular note, the methods of this paper avoid the use of the truncated Poisson formula, and thus can be applied to much longer intervals [a,b] with far better results. We provide a detailed analysis of the error term in the case g(x)=1 and f(x)=(x/3)^{3/2}.

math.NT↗

On Multiplicative Functions with Bounded Partial Sums

Consider a multiplicative function f(n) taking values on the unit circle. Is it possible that the partial sums of this function are bounded? We show that if we weaken the notion of multiplicativity so that f(pn)=f(p)f(n) for all primes p in some finite set P, then the answer is yes. We also discuss a result of Bronstein that shows that functions modified from characters at a finite number of places.

math.NT↗