arXiv · 2305.02672
Proving Properties of $\varphi$-Representations with the Walnut Theorem-Prover
Abstract
We revisit a classic theorem of Frougny and Sakarovitch concerning automata for $\varphi$-representations, and show how to obtain it in a different and more computationally direct way. Using it, we can find simple, induction-free proofs of existing results in the literature about these representations, in a uniform and straightforward manner. In particular, we can easily and "automatically'' recover many of the results of recent papers of Dekking and Van Loon. We also obtain a number of new results on $\varphi$-representations.
Explore related subjects
Keep this discovery
Jeffrey Shallit. 2023-05-04. Proving Properties of $\varphi$-Representations with the Walnut Theorem-Prover. https://doi.org/10.46298/cm.12627
Cite the original work for its findings. Save a collection to share your selection of sources.
Discover connections
Connections use source metadata and explicit phrase matches, not verified experimental comparisons.