m

F Nous contacter

0

Documents  11B85 | enregistrements trouvés : 11

O
     

-A +A

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research schools;Algebra;Combinatorics;Computer Science;Number Theory

We will cover some of the more important results from commutative and noncommutative algebra as far as applications to automatic sequences, pattern avoidance, and related areas. Well give an overview of some applications of these areas to the study of automatic and regular sequences and combinatorics on words.

11B85 ; 68Q45 ; 68R15

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research talks

Any algebraic (resp. linear) relation over the field of rational functions with algebraic coefficients between given analytic functions leads by specialization to algebraic (resp. linear) relations over the field of algebraic numbers between the values of these functions. Number theorists have long been interested in proving results going in the other direction. Though the converse result is known to be false in general, Mahler’s method provides one of the few known instances where it essentially holds true. After the works of Nishioka, and more recently of Philippon, Faverjon and the speaker, the theory of Mahler functions in one variable is now rather well understood. In contrast, and despite the contributions of Mahler, Loxton and van der Poorten, Kubota, Masser, and Nishioka among others, the theory of Mahler functions in several variables remains much less developed. In this talk, I will discuss recent progresses concerning the case of regular singular systems, as well as possible applications of this theory. This is a joint work with Colin Faverjon. Any algebraic (resp. linear) relation over the field of rational functions with algebraic coefficients between given analytic functions leads by specialization to algebraic (resp. linear) relations over the field of algebraic numbers between the values of these functions. Number theorists have long been interested in proving results going in the other direction. Though the converse result is known to be false in general, Mahler’s method provides ...

11J81 ; 11J85 ; 11B85

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research schools;Computer Science;Logic and Foundations;Number Theory

The theorem of Büchi-Bruyère states that a subset of $N^d$ is $b$-recognizable if and only if it is $b$-definable. As a corollary, the first-order theory of $(N,+,V_b)$ is decidable (where $V_b(n)$ is the largest power of the base $b$ dividing $n$). This classical result is a powerful tool in order to show that many properties of $b$-automatic sequences are decidable. The first part of my lecture will be devoted to presenting this result and its applications to $b$-automatic sequences. Then I will move to $b$-regular sequences, which can be viewed as a generalization of $b$-automatic sequences to integer-valued sequences. I will explain bow first-order logic can be used to show that many enumeration problems of $b$-automatic sequences give rise to corresponding $b$-regular sequences. Finally, I will consider more general frameworks than integer bases and (try to) give a state of the art of the research in this domain. The theorem of Büchi-Bruyère states that a subset of $N^d$ is $b$-recognizable if and only if it is $b$-definable. As a corollary, the first-order theory of $(N,+,V_b)$ is decidable (where $V_b(n)$ is the largest power of the base $b$ dividing $n$). This classical result is a powerful tool in order to show that many properties of $b$-automatic sequences are decidable. The first part of my lecture will be devoted to presenting this result and its ...

68R15 ; 11B85 ; 68Q45 ; 03B25

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research schools;Analysis and its Applications;Combinatorics;Dynamical Systems and Ordinary Differential Equations;Number Theory

28A80 ; 37A30 ; 37B10 ; 37E05 ; 11B85 ; 11B83 ; 68R15

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.


ISBN 978-0-8218-0962-4

Memoirs of the american mathematical society , 0663

Localisation : Collection 1er étage

C-algébre # analyse de Fourier # espace d'Hilbert # representation des groupes

11B85 ; 42C05 ; 46L55 ; 47C15

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- 402 p.
ISBN 978-3-540-44141-0

Lecture notes in mathematics , 1794

Localisation : Collection 1er étage

combinatoire des mots # transcendance # dynamique symbolique # fractal # théorie ergodique # suite de Sturm # fraction continue # système dynamique # suite automatique

11B85 ; 11A55 ; 11A63 ; 11J70 ; 11Kxx ; 11R06 ; 28A80 ; 28Dxx ; 37Axx ; 37BXX ; 40A15 ; 68Q45 ; 68R15

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- 191 p.
ISBN 978-3-11-015629-4

De Gruyter expositions in mathematics , 0036

Localisation : Ouvrage RdC (HAES)

théorie des nombres # série automatique # automate # langage formel # combinatoire des mots # groupe d'Heisenberg # équation de Mahler # suite de Thue-Morse

11B85 ; 68R15

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- 318 p.
ISBN 978-0-8218-3387-2

Mathematical surveys and monographs , 0104

Localisation : Collection 1er étage

théorie des nombres # suite définie par récurrence # recurrence # suite automatique # courbe elliptique # distribution modulo 1 # nombre pseudo-alléatoire # cryptographie # somme exponentielle # automate cellulaire

11B37 ; 11B85 ; 11G05 ; 11J71 ; 11K45 ; 11T23 ; 37B15 ; 94A60

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- xvi; 571 p.
ISBN 978-0-521-82332-6

Localisation : Ouvrage RdC (ALLO)

suite automatique # théorie des nombres # combinatoire des mots # automate # morphisme uniforme # langage formel

11B85 ; 11-01 ; 68R15 ; 68Q45

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- xiii; 504 p.
ISBN 978-0-521-18071-9

Encyclopedia of mathematics and its applications , 0090

Localisation : Collection 1er étage

combinatoire des mots # algèbre combinatoire

68R15 ; 68-02 ; 11B85

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research talks;Number Theory

Automatic sequences and their number theoretic properties have been intensively studied during the last 20 or 30 years. Since automatic sequences are quite regular (they just have linear subword complexity) they are definitely no "quasi-random" sequences. However, the situation changes drastically when one uses proper subsequences, for example the subsequence along primes or squares. It is conjectured that the resulting sequences are normal sequences which could be already proved for the Thue-Morse sequence along the subsequence of squares.
This kind of research is very challenging and was mainly motivated by the Gelfond problems for the sum-of-digits function. In particular during the last few years there was a spectacular progress due to the Fourier analytic method by Mauduit and Rivat. In this talk we survey some of these recent developments. In particular we present a new result on subsequences along primes of so-called invertible automatic sequences.
Automatic sequences and their number theoretic properties have been intensively studied during the last 20 or 30 years. Since automatic sequences are quite regular (they just have linear subword complexity) they are definitely no "quasi-random" sequences. However, the situation changes drastically when one uses proper subsequences, for example the subsequence along primes or squares. It is conjectured that the resulting sequences are normal ...

11B85

... Lire [+]

Z