Zobrazeno 1 - 10
of 198
pro vyhledávání: '"Christophe Reutenauer"'
Autor:
Antoine Abram, Christophe Reutenauer
Publikováno v:
Enumerative Combinatorics and Applications, Vol 3, Iss 3, p Article #S2R19 (2023)
Externí odkaz:
https://doaj.org/article/642a2b15e1834e7fb1681482c7091aee
Autor:
Christophe Reutenauer, Marco Robado
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR,..., Iss Proceedings (2012)
We give in a particular case a combinatorial proof of a recent algebraicity result of Kontsevich; the proof uses generalized one-sided and two-sided Dyck words, or equivalently, excursions and bridges. We indicate a noncommutative version of these no
Externí odkaz:
https://doaj.org/article/15fe9c5baeb14e969309c2a39312488a
Autor:
Jean Berstel, Christophe Reutenauer
The algebraic theory of automata was created by Schützenberger and Chomsky over 50 years ago and there has since been a great deal of development. Classical work on the theory to noncommutative power series has been augmented more recently to areas
This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays
Autor:
Jean-Éric Pin, Christophe Reutenauer
Publikováno v:
Journal of Noncommutative Geometry. 16:1055-1101
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::548e435d04af547d4eb0cd065644fe24
https://doi.org/10.4171/jncg/480
https://doi.org/10.4171/jncg/480
Autor:
Christophe Reutenauer
Publikováno v:
Journal of Number Theory. 227:265-305
A formula giving the exact error term for convergents of quadratic numbers is given. This formula is applied to Markoff forms and Markoff irrationalities: characterization of the smallest values of the form (the minimum being the corresponding Markof
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cda3846cf0c111424e3b7f4652382efa
https://doi.org/10.1016/j.jnt.2021.03.005
https://doi.org/10.1016/j.jnt.2021.03.005
Publikováno v:
Theoretical Computer Science. 809:21-29
The Markoff equation is the Diophantine equation x 2 + y 2 + z 2 = 3 x y z . A solution is called a Markoff triple. We give a bijection between the free monoid on two letters and the set of Markoff triples, using the palindromization map of Aldo de L
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c513129310fbaf415de9fcc4edbb2e4
https://doi.org/10.1016/j.tcs.2019.10.048
https://doi.org/10.1016/j.tcs.2019.10.048
The character theory of symmetric groups, and the theory of symmetric functions, both make use of the combinatorics of Young tableaux, such as the Robinson-Schensted algorithm, Schuetzenberger's "jeu de taquin", and evacuation. In 1995 Poirier and th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::098ed678ebf48343180f89e2bb9617bf
http://arxiv.org/abs/2010.06731
http://arxiv.org/abs/2010.06731
Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an interval in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe52bc9bb9b89f56e14cf351984e92ad