Algebraic power series and their automatic complexity I: finite fields

by   Eric Rowland, et al.

Christol's theorem states that a power series with coefficients in a finite field is algebraic if and only if its coefficient sequence is automatic. A natural question is how the size of a polynomial describing such a sequence relates to the size of an automaton describing the same sequence. Bridy used tools from algebraic geometry to bound the size of the minimal automaton for a sequence, given its minimal polynomial. We produce a new proof of Bridy's bound by embedding algebraic sequences as diagonals of rational functions. Crucially for our interests, our approach can be adapted to work not just over a finite field but over the integers modulo p^α.


page 1

page 2

page 3

page 4


Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field

We address the question of computing one selected term of an algebraic p...

A New Rational Approach to the Square Root of 5

In this paper, authors construct a new type of sequence which is named a...

Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity

The diagonal of a multivariate power series F is the univariate power se...

Algebraic Diagonals and Walks

The diagonal of a multivariate power series F is the univariate power se...

A sharper multivariate Christol's theorem with applications to diagonals and Hadamard products

We provide a new proof of the multivariate version of Christol's theorem...

Multiplicity Problems on Algebraic Series and Context-Free Grammars

In this paper we obtain complexity bounds for computational problems on ...

Bound states of a quartic and sextic inverse-powerlaw potential for all angular momenta

We use the tridiagonal representation approach to solve the radial Schrö...

Please sign up or login with your details

Forgot password? Click here to reset