• Aucun résultat trouvé

COMBINATORICS OF WORDS COMBINATORICS OF WORDS AND ARITHMETICS AND ARITHMETICS CIMPA S

N/A
N/A
Protected

Academic year: 2022

Partager "COMBINATORICS OF WORDS COMBINATORICS OF WORDS AND ARITHMETICS AND ARITHMETICS CIMPA S"

Copied!
1
0
0

Texte intégral

(1)

COMBINATORICS OF WORDS COMBINATORICS OF WORDS

AND ARITHMETICS AND ARITHMETICS

CIMPA S

CHOOL

IN

MOSSOUL (IRAQ)

September 8-18, 2003

(dates to be confirmed)

This school consists in a series of graduate lectures on the following topics:

- introduction to automata and formal languages, - formal languages and polylogarithms,

- sturmian sequences and continued fractions, - arithmetic properties of automata.

Organizors!: Christian Mauduit (Université de la Méditerranée), Nazar Shuker (Mossoul University) and Michel Waldschmidt (Université Pierre et Marie Curie).

Expected speakers!:

- Pierre Arnoux, Université de la Méditerranée, - Pierre Cartier, École Normale Supérieure de Paris, - Julien Cassaigne, Institut de Mathématiques de Luminy, - Sébastien Ferenczi, Institut de Mathématiques de Luminy, - Jean-Louis Maltret, Université de la Méditerranée,

- Christian Mauduit, Université de la Méditerranée, - Michel Waldschmidt, Université Pierre et Marie Curie.

Information!:

http://www-mathdoc.ujf-grenoble.fr/CIMPA/Anglais/2003Prog/Irak03-a.html

Références

Documents relatifs

- Pierre Arnoux, Université de la Méditerranée, - Pierre Cartier, École Normale Supérieure de Paris, - Julien Cassaigne, Institut de Mathématiques de Luminy, - Sébastien

mean values of the three parameters (covered space, discrepancy and Arnold mea- sure) share the same behaviour in the four probabilistic models (real versus rational,

- Other notions of complexity for infinite words were defined by S´ ebastien Ferenczi and Zolt´ an K´ asa in their paper of WORDS 1997: the behavior of upper (lower) total

In the workshop of 2007, several contributions to the topic are also presented: Nicolas B´ edaride, Eric Domenjoud, Damien Jamet and Jean-Luc Remy study the number of balanced words

There exists a bijection between the class of trees of size n having two stems per node, and the class of rooted triangulations with n +

La difficulté de cette tâche a été volontairement augmentée, afin de voir dans quelle mesure un algorithme évolutionniste peut trouver des solutions à un problème très diffi-

For instance, Arnoux-Rauzy substitutions are known to be Pisot [1] and thus to generate finitely balanced Arnoux- Rauzy words.. Here, finitely balanced means that they are

۝ Problem 4. Here’s a table of the natural numbers which are lower than 100.. 1) We want to keep the prime numbers, and to eliminate the numbers which are not prime. What’s