SearcharxivSearch

arXiv subjects

Bill Mance

Publications and source records attributed to Bill Mance.

At least 19 recordsLinked to original sources

On the Hausdorff dimension of the difference sets between typical and normal numbers

We study the Hausdorff dimension of the difference sets between the set of typical numbers, defined via the Erd\H{o}s--R\'enyi law governing the longest run of digits, and the set of numbers normal in base $2$. Although both properties hold for Lebesgue-almost every real number, neither implies the other. The resulting difference sets $\textit{TpcN}\setminus\textit{Normal}$ and $\textit{Normal}\setminus\textit{TpcN}$ are $D_2({\bf \Pi}_3^0)$-complete in the Borel hierarchy. We show that this logical complexity is matched geometrically: both difference sets have full Hausdorff dimension. Unlike the classical Besicovitch-type sets governing single-digit frequencies, normality requires the correct frequency of every finite block simultaneously, and the explicit Moran-set constructions that succeed for simple normality break down under this requirement. We instead establish the dimension via a counting argument bypassing the need for an explicit construction.

math.NT

The Theory of Normality for Dynamically Generated Cantor Series Expansions

The theory of normality for base $g$ expansions of real numbers in $[0,1)$ is rich and well developed. Similar theories have been developed for many other numeration systems, such as the regular continued fraction expansion, $\beta$-expansions, and L\"uroth series expansions. Let $Q=(q_n)_{n \in \mathbb{N}}$ be a sequence of integers greater than or equal to 2. The $Q$-Cantor series expansion of $x \in [0,1)$ is the unique sum of the form $x=\sum_{n=1}^\infty \frac{x_n}{q_1q_2\cdots q_n}$, where $x_n \neq q_n-1$ infinitely often. For the Cantor series expansions, most of the literature thus far considers $Q$ where the theory of normality differs drastically from that of the base $g$ expansions. We introduce the class of dynamically generated Cantor series expansions, which is a large class of Cantor series expansions for which much of the classical theory of base $g$ expansions can be developed in parallel. This class includes many examples such as the Thue-Morse sequence on $\{2,3\}$ and translated Champernowne numbers. A special case of our main results is that if $Q$ is a bounded basic sequence that is dynamically generated by an ergodic system having zero entropy, then normality base $Q$ coincides with distribution normality base $Q$, and $Q$ possesses a Hot Spot Theorem.

math.DS

Borel Complexity of the set of vectors normal for a fixed recurrence sequence

In this paper, we consider recurrence sequences $x_n=\xi_1 \alpha_1^n+\xi_2 \alpha_2^n$ ($n=0,1,\ldots$) with companion polynomial $P(X)$. For example, the sequence $x_n=\xi_1(4+\sqrt{2})^n+\xi_2(4-\sqrt{2})^n$ satisfies the recurrence $x_{n+2}-8x_{n+1}+14x_n=0$ and has companion polynomial $P(X)=X^2-8X+14=(X-4-\sqrt{2})(X-4+\sqrt{2})$. We call $(\xi_1,\xi_2)$ normal with respect to the recurrence relation determined by $P(X)$ when $(x_n)_{n\ge 0}$ is uniformly distributed modulo one. Determining the Borel complexity of the set of normal vectors for a fixed recurrence sequence is unresolved even for most geometric progressions. Under certain assumptions, we prove that the set of normal vectors is $\boldsymbol{\Pi}_3^0$-complete. A special case is the new result that the sets of numbers normal in base $\alpha$, i.e. $\{\xi\in \mathbb{R}\mid (\xi\alpha^n)_{n\geq 0}\mbox{ is u.d. modulo one.} \}$, are $\boldsymbol{\Pi}_3^0$-complete for every real number $\alpha$ with $|\alpha|$ Pisot. We analyze the fractional parts of recurrence sequences in terms of finite words via certain numeration systems. One of the difficulties in proving the main result is that even when recurrence sequences are uniformly distributed modulo one, it is not known what the average frequencies of the digits in the corresponding digital expansions are or if they even must exist.

math.LO

Undecidability in the Ramsey theory of polynomial equations and Hilbert's tenth problem

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p \in \mathbb{Z}[x_1,\cdots,x_n]$ for which the equation $p(x_1,\cdots,x_n) = 0$ is partition regular over $\mathbb{Z}\setminus\{0\}$ is undecidable conditional on Hilbert's tenth problem for $\mathbb{Q}$. For other integral domains, we get the analogous result unconditionally. More generally, we determine the exact lightface complexity of the various sets of interest. For example, we show that the set of homogeneous polynomials $p \in \mathbb{F}_q(t)[x_1,\cdots,x_n]$ for which the equation $p(x_1,\cdots,x_n) = 0$ is partition regular over $\mathbb{F}_q(t)\setminus\{0\}$ is $\Pi_2^0$-complete. We also prove several other results of independent interest. These include a compactness principle and a uniformity principle for density Ramsey theory on countable cancellative left amenable semigroups, as well as the existence of the natural extension for measure preserving systems of countable cancellative left reversible semigroups.

math.LO

The descriptive complexity of the set of Poisson generic numbers

Let $b\ge 2$ be an integer. We show that the set of real numbers that are Poisson generic in base $b$ is $\boldsymbol{\Pi}^0_3$-complete in the Borel hierarchy of subsets of the real line. Furthermore, the set of real numbers that are Borel normal in base $b$ and not Poisson generic in base $b$ is complete for the class given by the differences between $\boldsymbol{\Pi}^0_3$ sets. We also show that the effective versions of these results hold in the effective Borel hierarchy.

math.LO

Borel complexity of sets of points with prescribed Birkhoff averages in Polish dynamical systems with a specification property

We study the descriptive complexity of sets of points defined by placing restrictions on statistical behaviour of their orbits in dynamical systems on Polish spaces. A particular examples of such sets are the set of generic points of a $T$-invariant Borel probability measure, but we also consider much more general sets (for example, $\alpha$-Birkhoff regular sets and the irregular set appearing in multifractal analysis of ergodic averages of a continuous real-valued function). We show that many of these sets are Borel. In fact, all these sets are Borel when we assume that our space is compact. We provide examples of these sets being non-Borel, properly placed at the first level of the projective hierarchy (they are complete analytic or co-analytic). This proves that the compactness assumption is in some cases necessary to obtain Borelness. When these sets are Borel, we use the Borel hierarchy to measure their descriptive complexity. We show that the sets of interest are located at most at the third level of the hierarchy. We also use a modified version of the specification property to show that for many dynamical systems these sets are properly located at the third level. To demonstrate that the specification property is a sufficient, but not necessary condition for maximal descriptive complexity of a set of generic points, we provide an example of a compact minimal system with an invariant measure whose set of generic points is $\Pi^0_3$-complete.

math.DS

On the Borel complexity of continued fraction normal, absolutely abnormal numbers

We show that normality for continued fractions expansions and normality for base-$b$ expansions are maximally logically separate. In particular, the set of numbers that are normal with respect to the continued fraction expansion but not base-$b$ normal for a fixed $b\ge 2$ is $D_2(\boldsymbol{\Pi}_3^0)$-complete. Moreover, the set of numbers that are normal with respect to the continued fraction expansion but not normal to \emph{any} base-$b$ expansion is $D_2(\boldsymbol{\Pi}_3^0)$-hard, confirming the existence of uncountably many such numbers, which was previously only known assuming the generalized Riemann hypothesis. By varying the method of proof we are also able to show that the set of base-$2$ normal, base-$3$ non-normal numbers is also $D_2(\boldsymbol{\Pi}_3^0)$-complete. We also prove an auxiliary result on the normality properties of the continued fraction expansions of fractions with a fixed denominator.

math.NT

A non-Borel special alpha-limit set in the square

We consider the complexity of special $\alpha$-limit sets, a kind of backward limit set for non-invertible dynamical systems. We show that these sets are always analytic, but not necessarily Borel, even in the case of a surjective map on the unit square. This answers a question posed by Kolyada, Misiurewicz, and Snoha.

math.DS

Descriptive complexity in Cantor series

A Cantor series expansion for a real number $x$ with respect to a basic sequence $Q=(q_1,q_2,\dots)$, where $q_i \geq 2$, is a representation of the form $x=a_0 + \sum_{i=1}^\infty \frac{a_i}{q_1q_2\cdots q_i}$ where $0 \leq a_i<q_i$. These generalize ordinary base $b$ expansions where $q_i=b$. Ki and Linton showed that for ordinary base $b$ expansions the set of normal numbers is a $\boldsymbol{\Pi}^0_3$-complete set, establishing the exact complexity of this set. In the case of Cantor series there are three natural notions of normality: normality, ratio normality,and distribution normality (these notions are equivalent for base $b$ expansions). We show that for any $Q$ the set $\mathscr{DN}(Q)$ of distribution normal number is $\boldsymbol{\Pi}^0_3$-complete, and if $Q$ is $1$-divergent (i.e., $\sum_{i=1}^\infty \frac{1}{q_i}$ diverges) then the sets $\mathscr{N}(Q)$ and $\mathscr{RN}(Q)$ of normal and ratio normal numbers are $\boldsymbol{\Pi}^0_3$-complete. We further show that all five non-trivial differences of these sets are $D_2(\boldsymbol{\Pi}^0_3)$-complete if $\lim_i q_i=\infty$ and $Q$ is $1$-divergent (the trivial case is $\mathscr{N}(Q)\setminus \mathscr{RN}(Q)=\emptyset$). This shows that except for the containment $\mathscr{N}(Q)\subseteq \mathscr{RN}(Q)$, these three notions are as independent as possible.

math.LO

Hotspot lemmas for non-compact spaces

We extend the hotspot lemma, or Piatetski\u{i}-Shapiro normality criterion, to dynamical systems on non-compact spaces. We build on the work of N. G. Moshchevitin and I. D. Shkredov, noting an issue in some of their proofs, and adding a necessary and sufficient condition to remove this issue.

math.DS

Borel complexity of sets of normal numbers via generic points in subshifts with specification

We study the Borel complexity of sets of normal numbers in several numeration systems. Taking a dynamical point of view, we offer a unified treatment for continued fraction expansions and base $r$ expansions, and their various generalisations: generalised L\"uroth series expansions and $\beta$-expansions. In fact, we consider subshifts over a countable alphabet generated by all possible expansions of numbers in $[0,1)$. Then normal numbers correspond to generic points of shift-invariant measures. It turns out that for these subshifts the set of generic points for a shift-invariant probability measure is precisely at the third level of the Borel hierarchy (it is a $\Pi^0_3$-complete set, meaning that it is a countable intersection of $F_\sigma$-sets, but it is not possible to write it as a countable union of $G_\delta$-sets). We also solve a problem of Sharkovsky--Sivak on the Borel complexity of the basin of statistical attraction. The crucial dynamical feature we need is a feeble form of specification. All expansions named above generate subshifts with this property. Hence the sets of normal numbers under consideration are $\Pi^0_3$-complete.

math.DS

On the transcendence of certain real numbers

In this article we discuss the transcendence of certain infinite sums and products by using the Subspace theorem. In particular we improve the result of Hančl and Rucki \cite{hancl3}.

math.NT

Some complexity results in the theory of normal numbers

Let $\mathscr{N}(b)$ be the set of real numbers which are normal to base $b$. A well-known result of H. Ki and T. Linton is that $\mathscr{N}(b)$ is $\boldsymbol{\Pi}^0_3$-complete. We show that the set $\mathscr{N}(b)$ of reals which preserve $\mathscr{N}(b)$ under addition is also $\boldsymbol{\Pi}^0_3$-complete. We use the characteriztion of $\mathscr{N}(b)$ given by G. Rauzy in terms of an entropy-like quantity called the noise. It follows from our results that no further characteriztion theorems could result in a still better bound on the complexity of $\mathscr{N}(b)$. We compute the exact descriptive complexity of other naturally occurring sets associated with noise. One of these is complete at the $\boldsymbol{\Pi}^0_4$ level. Finally, we get upper and lower bounds on the Hausdorff dimension of the level sets associated with the noise.

math.LO

Normality of different orders for Cantor series expansions

Let $S \subseteq \mathbb{N}$ have the property that for each $k \in S$ the set $(S - k) \cap \mathbb{N} \setminus S$ has asymptotic density $0$. We prove that there exists a basic sequence $Q$ where the set of numbers $Q$-normal of all orders in $S$ but not $Q$-normal of all orders not in $S$ has full Hausdorff dimension. If the function $k \mapsto 1_S(k)$ is computable, then there exist computable examples. For example, there exists a computable basic sequence $Q$ where the set of numbers normal of all even orders and not normal of all odd orders has full Hausdorff dimension. This is in strong constrast to the $b$-ary expansions where any real number that is normal of order $k$ must also be normal of all orders between $1$ and $k-1$. Additionally, all numbers we construct satisfy the unusual condition that block frequencies sampled along non-trivial arithmetic progressions don't converge to the expected value. This is also in strong contrast to the case of the $b$-ary expansions, but more similar to the case of the continued fraction expansion. As a corollary, the set of $Q$-normal numbers that are not normal when sampled along any non-trivial arithmetic progression has full Hausdorff dimension.

math.NT

Number theoretic applications of a class of Cantor series fractal functions,I

Suppose that $(P,Q) \in \mathbb{N}_2^{\mathbb{N}} \times \mathbb{N}_2^{\mathbb{N}}$ and $x=E_0.E_1E_2\cdots$ is the $P$-Cantor series expansion of $x \in \mathbb{R}$. We define $ψ_{P,Q}(x):=\sum_{n=1}^\infty \frac {\min(E_n,q_n-1)} {q_1 \cdots q_n}$. The functions $ψ_{P,Q}$ are used to construct many pathological examples of normal numbers. These constructions are used to give the complete containment relation between the sets of $Q$-normal, $Q$-ratio normal, and $Q$-distribution normal numbers and their pairwise intersections for fully divergent $Q$ that are infinite in limit. We analyze the Hölder continuity of $ψ_{P,Q}$ restricted to some judiciously chosen fractals. This allows us to compute the Hausdorff dimension of some sets of numbers defined through restrictions on their Cantor series expansions. In particular, the main theorem of a paper by Y. Wang {\it et al.} \cite{WangWenXi} is improved. Properties of the functions $ψ_{P,Q}$ are also analyzed. Multifractal analysis is given for a large class of these functions and continuity is fully characterized. We also study the behavior of $ψ_{P,Q}$ on both rational and irrational points, monotonicity, and bounded variation. For different classes of ergodic shift invariant Borel probability measures $μ_1$ and $μ_2$ on $\mathbb{N}_2^{\mathbb{N}}$, we study which of these properties $ψ_{P,Q}$ satisfies for $μ_1 \times μ_2$-almost every $(P,Q) \in \mathbb{N}_2^{\mathbb{N}} \times \mathbb{N}_2^{\mathbb{N}}$. Related classes of random fractals are also studied.

math.NT

Shrinking targets for non-autonomous dynamical systems corresponding to Cantor series expansions

We provide a closed formula of Bowen type for the Hausdorff dimension of a very general shrinking target scheme generated by the non-autonomous dynamical system on the interval $[0,1)$, viewed as $\mathbb{R}/\mathbb{Z}$, corresponding to a given method of Cantor series expansion. We also examine a wide class of examples utilizing our theorem. In particular, we provide a Diophantine approximation interpretation of our scheme.

math.DS