Namespaces
Variants
Actions

Difference between revisions of "Pisot sequence"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
m (AUTOMATIC EDIT (latexlist): Replaced 56 formulas out of 56 by TEX code with an average confidence of 2.0 and a minimal confidence of 2.0.)
Line 1: Line 1:
The standard Pisot <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p1201402.png" />-sequence <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p1201403.png" /> is the sequence of positive integers <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p1201404.png" /> defined for <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p1201405.png" /> by the recursion
+
<!--This article has been texified automatically. Since there was no Nroff source code for this article,
 +
the semi-automatic procedure described at https://encyclopediaofmath.org/wiki/User:Maximilian_Janisch/latexlist
 +
was used.
 +
If the TeX and formula formatting is correct, please remove this message and the {{TEX|semi-auto}} category.
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p1201406.png" /></td> </tr></table>
+
Out of 56 formulas, 56 were replaced by TEX code.-->
  
if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p1201407.png" />, where <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p1201408.png" /> denotes the nearest integer function. For example <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p1201409.png" />. If <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014010.png" />, one can show that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014011.png" />, where <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014012.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014013.png" /> and where
+
{{TEX|semi-auto}}{{TEX|done}}
 +
The standard Pisot $E$-sequence $E ( a _ { 0 } , a _ { 1 } )$ is the sequence of positive integers $\{ a _ { n } \}$ defined for $0 &lt; a _ { 0 } &lt; a _ { 1 }$ by the recursion
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014014.png" /></td> </tr></table>
+
\begin{equation*} a _ { n } = N \left( \frac { a _ { n - 1} ^ { 2 }  } { a _ { n  - 2} } \right), \end{equation*}
  
Thus, at least when <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014015.png" />, it is clear that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014016.png" /> is badly distributed modulo <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014017.png" /> (cf. also [[Distribution modulo one|Distribution modulo one]]). These sequences were originally considered in [[#References|[a7]]] for this reason.
+
if $n \geq 2$, where $N ( x ) = \lfloor x + 1 / 2 \rfloor$ denotes the nearest integer function. For example $E ( 3,5 ) = \{ 3,5,8,13 , \dots \}$. If $a _ { 1 } &gt; a _ { 0 } + 2 \sqrt { a _ { 0 } }$, one can show that $a _ { n } = \lambda \theta ^ { n } + \epsilon _ { n }$, where $\lambda &gt; 0$ and $\theta = \theta ( a _ { 0 } , a _ { 1 } ) &gt; 1$ and where
  
The <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014018.png" /> are called <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014020.png" />-numbers. The set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014021.png" /> of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014022.png" />-numbers is dense in the interval <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014023.png" />. <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014024.png" /> contains the set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014025.png" /> of those <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014026.png" /> for which there is a <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014027.png" /> such that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014028.png" />. (Here <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014029.png" /> denotes the distance from <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014030.png" /> to the nearest integer.) It follows that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014031.png" /> is countable. The set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014032.png" /> also contains the set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014033.png" /> of Pisot numbers (cf. [[Pisot number|Pisot number]]) and the set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014034.png" /> of Salem numbers (cf. [[Salem number|Salem number]]).
+
\begin{equation*} \operatorname {lim} \operatorname{sup} | \epsilon _ { n } | \leq \frac { 1 } { 2 ( \theta - 1 ) ^ { 2 } }. \end{equation*}
  
The recurrent <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014036.png" />-sequences are those that satisfy linear recurrence relations. The corresponding subset of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014037.png" /> is denoted by <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014038.png" />. It was shown in [[#References|[a6]]] that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014039.png" />. A proof that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014040.png" />, as envisaged in [[#References|[a7]]], would show that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014041.png" /> and hence that:
+
Thus, at least when $\theta &gt; 2$, it is clear that $\lambda \theta ^ { n }$ is badly distributed modulo $1$ (cf. also [[Distribution modulo one|Distribution modulo one]]). These sequences were originally considered in [[#References|[a7]]] for this reason.
  
i) <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014042.png" />; and
+
The $\theta ( a _ { 0 } , a _ { 1 } )$ are called $E$-numbers. The set $E$ of $E$-numbers is dense in the interval $[ 1 , \infty )$. $E$ contains the set $H$ of those $\theta$ for which there is a $\lambda &gt; 0$ such that $\| \lambda \theta ^ { n } \| \rightarrow 0$. (Here $\| x \| = \operatorname { dist } ( x , \mathbf{Z} ) = | x - N ( x ) |$ denotes the distance from $x$ to the nearest integer.) It follows that $H$ is countable. The set $E$ also contains the set $S$ of Pisot numbers (cf. [[Pisot number|Pisot number]]) and the set $T$ of Salem numbers (cf. [[Salem number|Salem number]]).
  
ii) <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014043.png" /> is dense in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014044.png" />. However, it was proved in [[#References|[a2]]] that there are non-recurrent <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014045.png" />-sequences and that the set of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014046.png" /> corresponding to these is dense in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014047.png" />. While this does not settle the question of whether <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014048.png" /> (since a given <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014049.png" /> might arise from both a recurrent and a non-recurrent Pisot sequence) it makes this unlikely. The prevailing opinion is that i) is true (Pisot's conjecture), but that ii) is false.
+
The recurrent $E$-sequences are those that satisfy linear recurrence relations. The corresponding subset of $E$ is denoted by $E_r$. It was shown in [[#References|[a6]]] that $E _ { r } = S \cup T$. A proof that $E = E_r$, as envisaged in [[#References|[a7]]], would show that $E = S \cup T$ and hence that:
  
Families of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014050.png" />-sequences of the type <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014051.png" /> were studied in [[#References|[a5]]], where conditions are given under which each member of such a family will satisfy a linear recurrence for sufficiently large <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014052.png" />. In this case the degree of the recurrence does not depend on <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014053.png" />. For example, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014054.png" /> is recurrent for <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014055.png" /> [[#References|[a5]]] but is non-recurrent for <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014056.png" /> [[#References|[a3]]].
+
i) $H = S$; and
  
Many generalizations of Pisot sequences are possible and some were already considered by Ch. Pisot in [[#References|[a3]]] (see also [[#References|[a1]]], Chapts. 13; 14). One interesting variant replaces the rounding operator <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014057.png" /> by other operators, perhaps dependent on <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014058.png" />. This can have a dramatic affect on the possible linear recurrence relations satisfied by the sequences (see, e.g. [[#References|[a4]]]).
+
ii) $T$ is dense in $[ 1 , \infty )$. However, it was proved in [[#References|[a2]]] that there are non-recurrent $E$-sequences and that the set of $\theta ( a _ { 0 } , a _ { 1 } )$ corresponding to these is dense in $[ ( 1 + \sqrt { 5 } ) / 2 , \infty )$. While this does not settle the question of whether $E = E_r$ (since a given $\theta$ might arise from both a recurrent and a non-recurrent Pisot sequence) it makes this unlikely. The prevailing opinion is that i) is true (Pisot's conjecture), but that ii) is false.
 +
 
 +
Families of $E$-sequences of the type $E ( a _ { 0 } , c _ { 1 } + a _ { 0 } ^ { 2 } m )$ were studied in [[#References|[a5]]], where conditions are given under which each member of such a family will satisfy a linear recurrence for sufficiently large $m$. In this case the degree of the recurrence does not depend on $m$. For example, $E ( 7,49 m + 15 )$ is recurrent for $m \geq 1$ [[#References|[a5]]] but is non-recurrent for $m = 0$ [[#References|[a3]]].
 +
 
 +
Many generalizations of Pisot sequences are possible and some were already considered by Ch. Pisot in [[#References|[a3]]] (see also [[#References|[a1]]], Chapts. 13; 14). One interesting variant replaces the rounding operator $N ( x )$ by other operators, perhaps dependent on $n$. This can have a dramatic affect on the possible linear recurrence relations satisfied by the sequences (see, e.g. [[#References|[a4]]]).
  
 
====References====
 
====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  M.J. Bertin,  A. Decomps–Guilloux,  M. Grandet–Hugot,  M. Pathiaux–Delefosse,  J.P. Schreiber,  "Pisot and Salem Numbers" , Birkhäuser  (1992)</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top">  D.W. Boyd,  "Pisot sequences which satisfy no linear recurrence"  ''Acta Arith.'' , '''32'''  (1977)  pp. 89–98  (See also: vol. 48 (1987), 191-195)</TD></TR><TR><TD valign="top">[a3]</TD> <TD valign="top">  D.W. Boyd,  "Pisot and Salem numbers in intervals of the real line"  ''Math. Comp.'' , '''32'''  (1978)  pp. 1244–1260</TD></TR><TR><TD valign="top">[a4]</TD> <TD valign="top">  D.W. Boyd,  "Linear recurrence relations for some generalized Pisot sequences"  F.Q. Gouvea (ed.)  N. Yui (ed.) , ''Advances in Number Theory'' , Oxford Univ. Press  (1993)  pp. 333–340</TD></TR><TR><TD valign="top">[a5]</TD> <TD valign="top">  D.G. Cantor,  "On families of Pisot E-sequences"  ''Ann. Sci. Ecole Norm. Sup.'' , '''9''' :  4  (1976)  pp. 283–308</TD></TR><TR><TD valign="top">[a6]</TD> <TD valign="top">  P. Flor,  "Über eine Klasse von Folgen naturlicher Zahler"  ''Math. Ann.'' , '''140'''  (1960)  pp. 299–307</TD></TR><TR><TD valign="top">[a7]</TD> <TD valign="top">  Ch. Pisot,  "La répartition modulo <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/p/p120/p120140/p12014059.png" /> et les nombres algébriques"  ''Ann. Scuola Norm. Sup. Pisa Cl. Sci.'' , '''7''' :  2  (1938)  pp. 205–248</TD></TR></table>
+
<table><tr><td valign="top">[a1]</td> <td valign="top">  M.J. Bertin,  A. Decomps–Guilloux,  M. Grandet–Hugot,  M. Pathiaux–Delefosse,  J.P. Schreiber,  "Pisot and Salem Numbers" , Birkhäuser  (1992)</td></tr><tr><td valign="top">[a2]</td> <td valign="top">  D.W. Boyd,  "Pisot sequences which satisfy no linear recurrence"  ''Acta Arith.'' , '''32'''  (1977)  pp. 89–98  (See also: vol. 48 (1987), 191-195)</td></tr><tr><td valign="top">[a3]</td> <td valign="top">  D.W. Boyd,  "Pisot and Salem numbers in intervals of the real line"  ''Math. Comp.'' , '''32'''  (1978)  pp. 1244–1260</td></tr><tr><td valign="top">[a4]</td> <td valign="top">  D.W. Boyd,  "Linear recurrence relations for some generalized Pisot sequences"  F.Q. Gouvea (ed.)  N. Yui (ed.) , ''Advances in Number Theory'' , Oxford Univ. Press  (1993)  pp. 333–340</td></tr><tr><td valign="top">[a5]</td> <td valign="top">  D.G. Cantor,  "On families of Pisot E-sequences"  ''Ann. Sci. Ecole Norm. Sup.'' , '''9''' :  4  (1976)  pp. 283–308</td></tr><tr><td valign="top">[a6]</td> <td valign="top">  P. Flor,  "Über eine Klasse von Folgen naturlicher Zahler"  ''Math. Ann.'' , '''140'''  (1960)  pp. 299–307</td></tr><tr><td valign="top">[a7]</td> <td valign="top">  Ch. Pisot,  "La répartition modulo $1$ et les nombres algébriques"  ''Ann. Scuola Norm. Sup. Pisa Cl. Sci.'' , '''7''' :  2  (1938)  pp. 205–248</td></tr></table>

Revision as of 16:45, 1 July 2020

The standard Pisot $E$-sequence $E ( a _ { 0 } , a _ { 1 } )$ is the sequence of positive integers $\{ a _ { n } \}$ defined for $0 < a _ { 0 } < a _ { 1 }$ by the recursion

\begin{equation*} a _ { n } = N \left( \frac { a _ { n - 1} ^ { 2 } } { a _ { n - 2} } \right), \end{equation*}

if $n \geq 2$, where $N ( x ) = \lfloor x + 1 / 2 \rfloor$ denotes the nearest integer function. For example $E ( 3,5 ) = \{ 3,5,8,13 , \dots \}$. If $a _ { 1 } > a _ { 0 } + 2 \sqrt { a _ { 0 } }$, one can show that $a _ { n } = \lambda \theta ^ { n } + \epsilon _ { n }$, where $\lambda > 0$ and $\theta = \theta ( a _ { 0 } , a _ { 1 } ) > 1$ and where

\begin{equation*} \operatorname {lim} \operatorname{sup} | \epsilon _ { n } | \leq \frac { 1 } { 2 ( \theta - 1 ) ^ { 2 } }. \end{equation*}

Thus, at least when $\theta > 2$, it is clear that $\lambda \theta ^ { n }$ is badly distributed modulo $1$ (cf. also Distribution modulo one). These sequences were originally considered in [a7] for this reason.

The $\theta ( a _ { 0 } , a _ { 1 } )$ are called $E$-numbers. The set $E$ of $E$-numbers is dense in the interval $[ 1 , \infty )$. $E$ contains the set $H$ of those $\theta$ for which there is a $\lambda > 0$ such that $\| \lambda \theta ^ { n } \| \rightarrow 0$. (Here $\| x \| = \operatorname { dist } ( x , \mathbf{Z} ) = | x - N ( x ) |$ denotes the distance from $x$ to the nearest integer.) It follows that $H$ is countable. The set $E$ also contains the set $S$ of Pisot numbers (cf. Pisot number) and the set $T$ of Salem numbers (cf. Salem number).

The recurrent $E$-sequences are those that satisfy linear recurrence relations. The corresponding subset of $E$ is denoted by $E_r$. It was shown in [a6] that $E _ { r } = S \cup T$. A proof that $E = E_r$, as envisaged in [a7], would show that $E = S \cup T$ and hence that:

i) $H = S$; and

ii) $T$ is dense in $[ 1 , \infty )$. However, it was proved in [a2] that there are non-recurrent $E$-sequences and that the set of $\theta ( a _ { 0 } , a _ { 1 } )$ corresponding to these is dense in $[ ( 1 + \sqrt { 5 } ) / 2 , \infty )$. While this does not settle the question of whether $E = E_r$ (since a given $\theta$ might arise from both a recurrent and a non-recurrent Pisot sequence) it makes this unlikely. The prevailing opinion is that i) is true (Pisot's conjecture), but that ii) is false.

Families of $E$-sequences of the type $E ( a _ { 0 } , c _ { 1 } + a _ { 0 } ^ { 2 } m )$ were studied in [a5], where conditions are given under which each member of such a family will satisfy a linear recurrence for sufficiently large $m$. In this case the degree of the recurrence does not depend on $m$. For example, $E ( 7,49 m + 15 )$ is recurrent for $m \geq 1$ [a5] but is non-recurrent for $m = 0$ [a3].

Many generalizations of Pisot sequences are possible and some were already considered by Ch. Pisot in [a3] (see also [a1], Chapts. 13; 14). One interesting variant replaces the rounding operator $N ( x )$ by other operators, perhaps dependent on $n$. This can have a dramatic affect on the possible linear recurrence relations satisfied by the sequences (see, e.g. [a4]).

References

[a1] M.J. Bertin, A. Decomps–Guilloux, M. Grandet–Hugot, M. Pathiaux–Delefosse, J.P. Schreiber, "Pisot and Salem Numbers" , Birkhäuser (1992)
[a2] D.W. Boyd, "Pisot sequences which satisfy no linear recurrence" Acta Arith. , 32 (1977) pp. 89–98 (See also: vol. 48 (1987), 191-195)
[a3] D.W. Boyd, "Pisot and Salem numbers in intervals of the real line" Math. Comp. , 32 (1978) pp. 1244–1260
[a4] D.W. Boyd, "Linear recurrence relations for some generalized Pisot sequences" F.Q. Gouvea (ed.) N. Yui (ed.) , Advances in Number Theory , Oxford Univ. Press (1993) pp. 333–340
[a5] D.G. Cantor, "On families of Pisot E-sequences" Ann. Sci. Ecole Norm. Sup. , 9 : 4 (1976) pp. 283–308
[a6] P. Flor, "Über eine Klasse von Folgen naturlicher Zahler" Math. Ann. , 140 (1960) pp. 299–307
[a7] Ch. Pisot, "La répartition modulo $1$ et les nombres algébriques" Ann. Scuola Norm. Sup. Pisa Cl. Sci. , 7 : 2 (1938) pp. 205–248
How to Cite This Entry:
Pisot sequence. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Pisot_sequence&oldid=17786
This article was adapted from an original article by David Boyd (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article