Reference : Extensions of the Pascal Triangle to Words, and Related Counting Problems
Dissertations and theses : Doctoral thesis
Physical, chemical, mathematical & earth Sciences : Mathematics
http://hdl.handle.net/2268/233348
Extensions of the Pascal Triangle to Words, and Related Counting Problems
English
Stipulanti, Manon mailto [Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes >]
2-Apr-2019
Université de Liège, ​Liège, ​​Belgique
Doctorat en Sciences
Rigo, Michel mailto
Charlier, Emilie mailto
Mathonet, Pierre mailto
Leroy, Julien mailto
Grabner, Peter mailto
Fokkink, Robbert mailto
Jungers, Raphaël mailto
Pin, Jean-Éric mailto
[en] Combinatorics on words ; automata theory ; number theory ; graph theory ; fractal theory ; binomial coefficients ; scattered subwords ; generalized Pascal triangles ; generalized Sierpiński gaskets ; regular sequences ; synchronized sequences ; automatic sequences ; numeration systems ; Parry numbers ; Perron numbers ; Bertrand numeration systems ; summatory function ; digital sequences ; asymptotic behavior
[en] The Pascal triangle and the corresponding Sierpiński fractal are fairly well-studied mathematical objects, which both exhibit connections with many different scientific areas. The first is made of binomial coefficients of integers that notably appear in combinatorics to tackle counting problems (for instance, they provide the number of possible ways to choose a given amount of elements from a set of elements). There exist multiple generalizations of those binomial coefficients. In this text, we focus on binomial coefficients of words, which count scattered subwords. The red thread of this thesis is precisely the combination of the Pascal triangle and binomial coefficients of words. The first part is dedicated to extensions of the Pascal triangle to various sets of words (languages) associated with different numeration systems. We transport the existing link between the Pascal triangle and the Sierpiński gasket to this wider setting. The second part is concerned with particular sequences extracted from generalized Pascal triangles. They count non-zeroes binomial coefficients on each row of a given Pascal-like triangle. We study their regularity and their automaticity with respect to different numeration systems. In the third and last part, we establish the asymptotics of the summatory functions of the sequences considered previously. The most important feature of this part might not necessarily be the result itself, but the underlying new method to achieve it.
Fonds pour la formation à la Recherche dans l'Industrie et dans l'Agriculture (Communauté française de Belgique) - FRIA
Researchers ; Professionals ; Students
http://hdl.handle.net/2268/233348

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
these.pdfAuthor preprint3.18 MBView/Open

Additional material(s):

File Commentary Size Access
Open access
Beamer_defense_these.pdfPrésentation1.83 MBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.