Automata Methods in Transcendence
نویسنده
چکیده
The purpose of this expository article is to explain diverse new tools that automata theory provides to tackle transcendence problems in function field arithmetic. We collect and explain various useful results scattered in computer science, formal languages, logic literature and explain how they can be fruitfully used in number theory, dealing with transcendence, refined transcendence and classification problems. 2010 Mathematics Subject Classification. Primary 11J93, 68Q45; Secondary 11B85, 11G09.
منابع مشابه
Automata and Transcendence of the Tate Period in Finite Characteristic
Using the techniques of automata theory, we give another proof of the function field analogue of the Mahler-Manin conjecture and prove transcendence results for the power series associated to higher divisor functions σk(n) = ∑ d|n d k. Let p be a prime number, and let k be an algebraic closure of Fp. Let q be a variable and consider a4, a6 ∈ k[[q]] defined by
متن کاملAutomata-Style Proof of Voloch's Result on Transcendence
For more on the Tate curve (which we will not use directly) and for standard facts on modular forms (which we will use later), see [S, Chap. 5; M. Chap. 1], respectively. Voloch's nice proof involved approximating q by algebraic quantities and getting a contradiction by analyzing the Galois action using Igusa's theorem. We offer below a proof based on the criterion of algebraicity due to Christ...
متن کاملTranscendence in Positive Characteristic and Special Values of Hypergeometric Functions
We prove a simple transcendence criterion suitable for function field arithmetic. We apply it to show the transcendence of special values at non-zero rational arguments (or more generally, at algebraic arguments which generate extension of the rational function field with less than q places at infinity) of the entire hypergeometric functions in the function field (over Fq) context, and to obtai...
متن کاملContext-Free Languages
Introduction 1 1 Languages 3 1.1 Notation and examples . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 Grammars . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.2 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.3 Ambiguity . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.1.4 Reduced grammars, normal forms . . . . . . . . . . . . . . . 6 1.1...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کامل