Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Transcendence of formal power series with rational coefficients
 

Summary: Transcendence of formal power series with rational
coefficients
J.­P. Allouche
CNRS, LRI
Universit'e Paris­Sud, B“atiment 490
F­91405 Orsay Cedex (France)
allouche@lri.fr
Abstract
We give algebraic proofs of transcendence over Q(X) of formal power series with
rational coefficients, by using inter alia reduction modulo prime numbers, and the
Christol theorem. Applications to generating series of languages and combinatorial
objects are given.
Keywords: transcendental formal power series, binomial series, automatic sequences,
p­Lucas sequences, Chomsky­Sch¨utzenberger theorem.
1 Introduction
Formal power series with integer coefficients often occur as generating series. Suppose that
a set E contains exactly a n elements of ``size'' n for each integer n: the generating series
of this set is the formal power series
P
n–0 a n X n (this series belongs to Z[[X]] ae Q[[X]]).

  

Source: Allouche, Jean-Paul - Laboratoire de Recherche en Informatique, Université de Paris-Sud 11

 

Collections: Computer Technologies and Information Sciences