Borel Complexity of the set of vectors normal for a fixed recurrence sequence
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912672547602432 |
|---|---|
| author | Kaneko, Hajime Mance, Bill |
| author_facet | Kaneko, Hajime Mance, Bill |
| contents | In this paper, we consider recurrence sequences $x_n=ξ_1 α_1^n+ξ_2 α_2^n$ ($n=0,1,\ldots$) with companion polynomial $P(X)$. For example, the sequence $x_n=ξ_1(4+\sqrt{2})^n+ξ_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 $(ξ_1,ξ_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Π_3^0$-complete. A special case is the new result that the sets of numbers normal in base $α$, i.e. $\{ξ\in \mathbb{R}\mid (ξα^n)_{n\geq 0}\mbox{ is u.d. modulo one.} \}$, are $\boldsymbolΠ_3^0$-complete for every real number $α$ with $|α|$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_23380 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Borel Complexity of the set of vectors normal for a fixed recurrence sequence Kaneko, Hajime Mance, Bill Logic Number Theory In this paper, we consider recurrence sequences $x_n=ξ_1 α_1^n+ξ_2 α_2^n$ ($n=0,1,\ldots$) with companion polynomial $P(X)$. For example, the sequence $x_n=ξ_1(4+\sqrt{2})^n+ξ_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 $(ξ_1,ξ_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Π_3^0$-complete. A special case is the new result that the sets of numbers normal in base $α$, i.e. $\{ξ\in \mathbb{R}\mid (ξα^n)_{n\geq 0}\mbox{ is u.d. modulo one.} \}$, are $\boldsymbolΠ_3^0$-complete for every real number $α$ with $|α|$ 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. |
| title | Borel Complexity of the set of vectors normal for a fixed recurrence sequence |
| topic | Logic Number Theory |
| url | https://arxiv.org/abs/2510.23380 |