A rigorous computer aided estimation for Gelfond exponent of weighted Thue-Morse sequences
Yiwei Zhang, Ke Yin, Wanquan Wu
TL;DR
This paper presents a rigorous computer-aided method to accurately estimate the Gelfond exponent of weighted Thue-Morse sequences, enhancing previous theoretical results with computational precision.
Contribution
It introduces a mathematically rigorous computational approach to estimate the Gelfond exponent for weighted Thue-Morse sequences, improving upon prior theoretical bounds.
Findings
Provides exact values and robustness estimates for the Gelfond exponent.
Improves previous bounds and discussions on Gelfond exponent.
Enhances understanding of weighted Thue-Morse sequences through computational methods.
Abstract
In this paper, we will provide a mathematically rigorous computer aided estimation for the exact values and robustness for Gelfond exponent of weighted Thue-Morse sequences. This result improves previous discussions on Gelfond exponent by Gelfond, Devenport, Mauduit, Rivat, S\'{a}rk\"{o}zy and Fan et. al.
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
TopicsMathematical Dynamics and Fractals · Coding theory and cryptography · semigroups and automata theory