Automata and the arithmetic of formal power series

Michel Mendès France; Alfred van der Poorten

Displaying similar documents to “Automata and the arithmetic of formal power series”

Algebraic independence by Mahler’s method and $S$ -unit equations

Kumiko Nishioka (1994)

Compositio Mathematica

Similarity:

Congruence properties of coefficients of certain algebraic power series

Matthijs Coster (1988)

Compositio Mathematica

Similarity:

On the power-series expansion of a rational function

D. V. Lee (1992)

Acta Arithmetica

Similarity:

Introduction. The problem of determining the formula for $P_{S} (n)$ , the number of partitions of an integer into elements of a finite set S, that is, the number of solutions in non-negative integers, $h_{s ₁}, . . ., h_{s_{k}}$ , of the equation hs₁ s₁ + ... + hsk sk = n, was solved in the nineteenth century (see Sylvester [4] and Glaisher [3] for detailed accounts). The solution is the coefficient of $x ⁿ i n$ [(1-xs₁)... (1-xsk)]-1, expressions for which they derived. Wright [5] indicated a simpler method by which to find part...