Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A note on Christol's theorem (1906.08703v1)

Published 20 Jun 2019 in math.NT and cs.FL

Abstract: Christol's theorem characterises algebraic power series over finite fields in terms of finite automata. In a recent article, Bridy develops a new proof of Christol's theorem by Speyer, to obtain a tight quantitative version, that is, to bound the size of the corresponding automaton in terms of the height and degree of the power series, as well as the genus of the curve associated with the minimal polynomial of the power series. Speyer's proof, and Bridy's development, both take place in the setting of algebraic geometry, in particular by considering K\"ahler differentials of the function field of the curve. In this note we show how an elementary approach, based on diagonals of bivariate rational functions, provides essentially the same bounds.

Citations (5)

Summary

We haven't generated a summary for this paper yet.