Transcendence for Pisot Morphic Words over an Algebraic Base
Pavol Kebis, Florian Luca, Joel Ouaknine, Andrew Scoones, James Worrell

TL;DR
This paper establishes a dichotomy for sums of Pisot morphic sequences over algebraic bases, showing they are either algebraic or transcendental, and proves transcendence for specific cases like the k-bonacci word.
Contribution
It extends the rational-transcendental dichotomy to irreducible Pisot morphic sequences and proves transcendence for certain well-known sequences.
Findings
Sum $[oldsymbol{u}]_eta$ is either algebraic or transcendental.
Transcendence is proven for the k-bonacci word.
Results depend on the Pisot conjecture, assuming pure discrete spectrum.
Abstract
It is known that for a uniform morphic sequence and an algebraic number such that , the number either lies in or is transcendental. In this paper we show a similar rational-transcendental dichotomy for sequences defined by irreducible Pisot morphisms. Subject to the Pisot conjecture (an irreducible Pisot morphism has pure discrete spectrum), we generalise the latter result to arbitrary finite alphabets. In certain cases we are able to show transcendence of outright. In particular, for , if is the -bonacci word then is transcendental.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Computability, Logic, AI Algorithms
