Combinatorial proof of the transcendence of $L(1,\chi_s)/\Pi$
Yining Hu

TL;DR
This paper presents a combinatorial proof demonstrating the transcendence of a specific function ratio in characteristic p, leveraging Christol's theorem and properties of automatic sequences, offering an alternative to previous proofs.
Contribution
It provides a new combinatorial proof of the transcendence of $L(1, heta_s)/oldsymbol{ au}$, distinct from Damamme's analytic approach, using automata theory.
Findings
Proof confirms transcendence of $L(1, heta_s)/oldsymbol{ au}$ in characteristic p.
Utilizes Christol's theorem and properties of automatic sequences.
Offers a combinatorial alternative to existing transcendence proofs.
Abstract
We give a combinatorial proof of the transcendence of , where (resp. ) is the analogue in characteristic of the function of Dirichlet (resp. ). This result has been proven by G. Damamme using the criteria of de Mathan. Our proof is based on the Theorem of Christol and another property of -automatic sequences.
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 · Mathematical Dynamics and Fractals · Advanced Combinatorial Mathematics
