Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Simple Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Simple Search

Query:
Enter a query and click »Search«...
Format:
Display: entries per page entries
Zbl 0656.10032
Loxton, J.H.
Automata and transcendence.
(English)
[A] New advances in transcendence theory, Proc. Symp., Durham/UK 1986, 215-228 (1988).

[For the entire collection see Zbl 0644.00005.] \par This is a report on finite automata and applications of transcendence theory, using functional equations of a type first developed by {\it K. Mahler} [Math. Ann. 101, 342-366 (1929); J. Number Theory 1, 512-521 (1969; Zbl 0184.076)] and by the author and {\it A. J. van der Poorten} in several papers [particularly in J. Reine Angew. Math. 330, 159-172 (1982; Zbl 0468.10019)]. \par Let $\alpha =(\alpha\sb n)\sb n$ be a sequence with entries belonging to a finite alphabet A of p letters $a\sb i$ and generated by a finite automaton. According to {\it A. Cobham} [Math. Syst. Theory 6, 164-192 (1972; Zbl 0253.02029)] $\alpha$ can be defined as a fixed point of a uniform (of length r) substitution on A. This leads to a functional equation like $F(z)=M(z)F(z\sp r)$ where $F(z)=(f\sb 1(z),...,f\sb p(z))\sp t$, $f\sb i(z)=\sum\sp{\infty}\sb{i=0}f\sb{i,n}z\sp n$, $f\sb{i,n}=0$ (resp. $=1)$ if $\alpha\sb n=a\sb i$ (resp. $\ne a\sb i)$ and M(z) is a $p\times p$-matrix whose entries are polynomials. In case of general substitutions, one also has analogous functional equations, namely $F(z)=M(z)F(Tz)$, but z is now a p-complex variable $(z\sb 1,...,z\sb p)$, T is a $p\times p$-matrix of nonnegative integer entries $t\sb{ij}$ and $(Tz)\sb i=\prod\sp{p}\sb{j=1}z\sb j\sp{t\sb{ij}}.$ \par If the functions $f\sb i$ are algebraically independent over ${\bbfC}(z)$, the aim is to get the numbers $f\sb i(\zeta)$ algebraically independent over ${\bbfQ}$ for a proper algebraic point $\zeta$ of ${\bbfC}\sp p$. Such a theorem requires technical assumptions on T, M and $\zeta$, due to the method, which have been discussed by the author (see the reference above for a complete statement). \par Transcendence measures obtained by {\it A. I. Galochkin} [Mat. Zametki 27, 175-183 (1980; Zbl 0426.10036)] and by {\it Yu. V. Nesterenko} [Astérisque 147/148, 141-149 (1987; Zbl 0615.10043)] on algebraic independence measures arising from functional equations as above are also considered.
[P.Liardet]
MSC 2000:
*11J81 Transcendence (general theory)
68Q70 Algebraic theory of automata

Keywords: transcendental numbers; Mahler's method; finite automata; substitutions; functional equations; Transcendence measures; algebraic independence measures

Citations: Zbl 0644.00005; Zbl 0184.076; Zbl 0468.10019; Zbl 0253.02029; Zbl 0426.10036; Zbl 0615.10043

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster