EUVIMEDEUVIMED entdecken
Crossref

Alphabets, rewriting trails and periodic representations in algebraic bases

Denys Dutykh, Jean-Louis Verger-Gaugry

Research in Number Theory · 2021-12 · 7 (4)

DOI: 10.1007/s40993-021-00290-w ↗

Kurz gefasst

Fachartikel in der Zeitschrift Research in Number Theory, online erschienen am 28.09.2021. Verfasst von Denys Dutykh und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 30 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For β>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta > 1$$\end{document} a real algebraic integer (the base), the finite alphabets A⊂Z\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {A}} \subset {\mathbb {Z}}$$\end{document} which realize the identity Q(β)=PerA(β)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {Q}}(\beta ) = \mathrm{Per}_{{\mathcal {A}}}(\beta )$$\end{document}, where PerA(β)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm{Per}_{{\mathcal {A}}}(\beta )$$\end{document} is the set of complex numbers which are (β,A)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\beta , {\mathcal {A}})$$\end{document}-eventually periodic representations, are investigated. Comparing with the greedy algorithm, minimal and natural alphabets are defined. The natural alphabets are shown to be correlated to the asymptotics of the Pierce numbers of the base β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} and Lehmer’s problem. The notion of rewriting trail is introduced to construct intermediate alphabets associated with small polynomial values of the base. Consequences on the representations of neighbourhoods of the origin in Q(β)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {Q}}(\beta )$$\end{document}, generalizing Schmidt’s theorem related to Pisot numbers, are investigated. Applications to Galois conjugation are given for convergent sequences of bases γs:=γn,m1,…,ms\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _s := \gamma _{n, m_1 , \ldots , m_s}$$\end{document} such that γs-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma _{s}^{-1}$$\end{document} is the unique root in (0, 1) of an almost Newman polynomial of the type -1+x+xn+xm1+⋯+xms\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$-1+x+x^n +x^{m_1}+\cdots + x^{m_s}$$\end{document}, n≥3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n \ge 3$$\end{document}, s≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s \ge 1$$\end{document}, m1-n≥n-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m_1 - n \ge n-1$$\end{document}, mq+1-mq≥n-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m_{q+1}-m_q \ge n-1$$\end{document} for all q≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$q \ge 1$$\end{document}. For β>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta > 1$$\end{document} a reciprocal algebraic integer close to one, the poles of modulus

Zitieren

APA

Dutykh, D., & Verger-Gaugry, J. (2021). Alphabets, rewriting trails and periodic representations in algebraic bases. Research in Number Theory, 7(4). https://doi.org/10.1007/s40993-021-00290-w

Vancouver

Dutykh D, Verger-Gaugry J. Alphabets, rewriting trails and periodic representations in algebraic bases. Research in Number Theory. 2021;7(4). doi:10.1007/s40993-021-00290-w

BibTeX
@article{Dutykh2021,
  author = {Dutykh, Denys and Verger-Gaugry, Jean-Louis},
  title = {Alphabets, rewriting trails and periodic representations in algebraic bases},
  journal = {Research in Number Theory},
  year = {2021},
  volume = {7},
  number = {4},
  doi = {10.1007/s40993-021-00290-w}
}
Kostenlos starten →