C. Reutenauer - Publications

Retour à la page principale

Publications

C. R.,On a matrix representation for polynomially recursive sequences , Electronic Journal of Combinatorics 19 (3) (2012) #36.

C. R., M. Robado,On an algebraicity theorem of Kontsevich , Poster au colloque Séries formelles et Combinatoire algébrique, Nagoya 2012.

I. Assem, C. R., Mutating seeds: types A and A tilde , Annales mathématiques Blaise Pascal 19 (2012), 29-73.

J. Berstel, C. De Felice, D. Perrin, C. R., G. Rindone, Recent results on syntactic groups of prefix codes , European Journal of Combinatorics 33 (2012), no. 7, 1386–1401.

I. Gessel, A. Restivo, C. R., A bijection between words and multisets of necklaces , European Journal of Combinatorics 33 (2012), no. 7, 1537–1546.

J. Berstel, C. De Felice, D. Perrin, C. Reutenauer, G. Rindone, Bifix codes and Sturmian words , Journal of Algebra 369 (2012), 146–202.

J. Berstel, C. R., Noncommutative rational series with applications. Encyclopedia of Mathematics and its Applications, 137. Cambridge University Press, Cambridge, 2011. xiv+248 pp. ISBN: 978-0-521-19022-0.
C. Malvenuto, C. R., A self paired Hopf algebra on double posets and a Littlewood-Richardson rule , Journal of Combinatorial Theory Ser. A 118 (2011), no. 4, 1322–1333.

G. Paquin, C. R., On the superimposition of Christoffel words , Theoretical Computer Science 412 (2011), no. 4-5, 402–418.

S. Brlek, C. R., Complexity and palindromic defect of infinite words , Theoretical Computer Science 412 (2011), no. 4-5, 493–497.

J.-C., Novelli, C. R., J.-Y. Thibon, Generalized descent patterns in permutations and associated Hopf algebras , European Journal of Combinatorics 32 (2011), no. 4, 618–627.

A. De Luca, C. R., Christoffel words and the Calkin-Wilf tree , Electronic Journal of Combinatorics 18 (2011), no. 2, Paper 22, 10 pp.

J. Berstel, D. Perrin, C. R., Codes and automata , Encyclopedia of Mathematics and its Applications, 129. Cambridge University Press, Cambridge, 2010. xiv+619 pp. ISBN: 978-0-521-88831-8.

S. Lavallée, D. Perrin, V. Retakh, C. R., Codes and noncommutative stochastic matrices , Journal of Noncommutive Geometry 4 (2010), no. 4, 531–554.

I. Assem, C. R., D. Smith, Friezes , Advances in Mathematics 225 (2010), no. 6, 3134–3165.

F. Bergeron, C. R., SLk-tilings of the plane , Illinois Journal of Mathematics 54 (2010), no. 1, 263–300.

S. Brlek, J.-O. Lachaud, X. Provençal, C. R., Lyndon+Christoffel = digitally convex , Pattern Recognition 42 (2009) 2239-2246.

J. Berstel, A. Lauve, C. R., F. Saliola, Combinatorics on words: Christoffel words and repetitions in words , CRM Monograph Series, 27. American Mathematical Society, Providence, RI, 2009. xii+147 pp. ISBN: 978-0-8218-4480-9

C. R., Christoffel words and Markoff triples , Integers 9 (2009), A26, 327–332.

S. Lavallée, C. R., Characteristic polynomials of nonnegative integral square matrices and clique polynomials Séminaire Lotharingien de Combinatoire 61A (2009), Article B61Ac, 11 pp.

Y. Bugeaud, C. R., S. Siksek, A Sturmian sequence related to the uniqueness conjecture for Markoff numbers , Theoretical Computer Science 410 (2009), no. 30-32, 2864–2869.

C. R., Michel Fliess and non-commutative formal power series , International Journal of Control 81 (2008), no. 3, 336–341.

V. Berthé,A. de Luca,C. R., On an involution of Christoffel words and Sturmian morphisms , European Journal of Combinatorics 29 (2008), no. 2, 535–553.

J. Berstel, C. R., Another proof of Soittola's theorem , Theoretical Computer Science 393 (2008), no. 1-3, 196–203.

N. Bergeron, Reutenauer, C. R., M. Rosas, M. Zabrocki, Invariants and coinvariants of the symmetric groups in noncommuting variables , Canadian Journal of Mathematics 60 (2008), no. 2, 266–296.

C. R., Le jeu de taquin de Schützenberger , [Schützenberger's jeu de taquin] Gazette des Mathématiciens No. 116 (2008), 5–10.

C. Kassel, C. R., A palindromization map for the free group , Theoretical Computer Science 409 (2008), no. 3, 461–470.

J. Berstel, C. R., Extension of Brzozowski’s derivation calculus of rational expressions to series over the free partially commutative monoids , Theoretical Computer Science 400 (2008) 144–158.

C. Kassel, C. R., Sturmian morphisms, the braid group B4, Christoffel words and bases of F2 , Annali di Matematica Pura ed Applicata (4) 186 (2007), no. 2, 317–339.

S. Lavallée, C. R., On a zeta function associated with automata and codes , Theoretical Computer Science 381 (2007), no. 1-3, 266–273.

C. R., Mots de Lyndon généralisés [Generalized Lyndon words] Séminaire Lotharingien de Combinatoire 54 (2006), Art. B54h, 16 pp.
J.-P. Borel, C. R., On Christoffel classes , RAIRO Theoretical Informatics and Applications 40 (2006), no. 1, 15–27.

C. R., On Markoff's property and Sturmian words , Mathematische Annalen 336 (2006), no. 1, 1–12.
P. McNamara, C. R., P-partitions and a multi-parameter Klyachko idempotent , Electronic Journal of Combinatorics 11 (2005), no. 2, Research Paper 21, 18 pp.

J.-P. Borel, C. R., Palindromic factors of billiard words , Theoretical Computer Science 340 (2005), no. 2, 334–348.

F. Patras, C. R., M. Schocker, On the Garsia Lie idempotent , Canadian Mathematical Bulletin 48 (2005), no. 3, 445–454.

J.-P. Borel, C. R., Some new results on palindromic factors of billiard words, Developments in language theory, 180–188, Lecture Notes in Computer Science, 3572, Springer, Berlin, 2005.

M. Fortin, C. R., Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank , Séminaire Lotharingien de Combinatoire 52 (2004), Article B52f, 12 pp.

S. Brlek, S. Hamel, M. Nivat, C. R., On the palindromic complexity of infinite words , International Journal Foundations of Computer Science 15 (2004), no. 2, 293–306.

F. Patras, C. R., On descent algebras and twisted bialgebras , Moscow Mathematical Journal 4 (2004), no. 1, 199–216, 311.

S. Brlek, C. R., On a valuation of rational subsets of Zk , Dédié à Jean Berstel. Selected papers in honor of Jean Berstel. Theoret. Comput. Sci. 292 (2003), no. 1, 85–96.

C. Kassel, A. Lascoux, C. R., The singular locus of a Schubert variety , Journal of Algebra 269 (2003), no. 1, 74–108.

C. Hohlweg, C. R., Lyndon words, permutations and trees , Theoretical Computer Science 307 (2003), no. 1, 173–178.

C. R., Free Lie algebras . Handbook of algebra, Vol. 3, 887–903, North-Holland, Amsterdam, 2003.

F. Patras, C. R., On Dynkin and Klyachko idempotents in graded bialgebras , Special issue in memory of Rodica Simion. Advances in Applied Mathematics 28 (2002), no. 3-4, 560–579.

F. Patras, C. R., Lie representations and an algebra containing Solomon's , Journal of Algebraic Combinatorics 16 (2002), no. 3, 301–314.

C. Hohlweg, C. R., Inverses of words and the parabolic structure of the symmetric group , European Journal of Combinatorics 22 (2001), no. 8, 1075–1082.

A. Jöllenbeck, C. R., Eine Symmetrieeigenschaft von Solomons Algebra und der höheren Lie-Charaktere , [A symmetry property of Solomon's algebra and the higher Lie characters] Abhandlungen des Mathematische Seminar Univinversität Hamburg 71 (2001), 105–111.

C. Kassel, A. Lascoux, C.R., Factorizations in Schubert cells , Advances in Mathematics 150 (2000), no. 1, 1–35.

V. Bruyère, C. R., A proof of Choffrut's theorem on subsequential functions , Theoretical Computer Science 215 (1999), no. 1-2, 329–335.

P. M.Cohn, C. R., On the construction of the free field , Dedicated to the memory of Marcel-Paul Schützenberger. International Journal of Algebra and Computation 9 (1999), no. 3-4, 307–323.

F. Patras, C. R., Higher Lie idempotents , Journal of Algebra 222 (1999), no. 1, 51–64.

V. Retakh, C. R., A. Vaintrob, Noncommutative rational functions and Farber's invariants of boundary links , Differential topology, infinite-dimensional Lie algebras, and applications, 237–246, Amer. Math. Soc. Transl. Ser. 2, 194, Amer. Math. Soc., Providence, RI, 1999.

C. R., Malcev-Neumann series and the free field , Expositiones Mathematicae 17 (1999), no. 5, 469–478.

C. Kassel, C. R., Une variante à la Coxeter du groupe de Steinberg , [A Coxeter variant of the Steinberg group] K-Theory 14 (1998), no. 4, 305–318.

C. Malvenuto, C. R., Plethysm and conjugation of quasi-symmetric functions , Selected papers in honor of Adriano Garsia (Taormina, 1994). Discrete Mathematics 193 (1998), no. 1-3, 225–233.

R. Stanley, C. R., R. J. Chapman, Problems and Solutions: Solutions: A Doubly Rational Generating Function: 10493. American Mathematical Monthly 105 (1998), no. 10, 956–958.

C. R., N-rationality of zeta functions , Advances in Applied Mathematics 18 (1997), no. 1, 1–17.

G.Duchamp, C. R., Un critère de rationalité provenant de la géométrie non commutative , [A rationality criterion from noncommutative geometry] Inventiones Mathematicae 128 (1997), no. 3, 613–622.

C. R., A survey of noncommutative rational series , Formal power series and algebraic combinatorics (New Brunswick, NJ, 1994), 159–169, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 24, Amer. Math. Soc., Providence, RI, 1996.

C. R., Inversion height in free fields , Selecta Mathematica (N.S.) 2 (1996), no. 1, 93–109.

G. Melançon, C. R., Free Lie superalgebras, trees and chains of partitions , Journal of Algebraic Combininatorics 5 (1996), no. 4, 337–351.

M.-P. Béal, O. Carton, C. R., Cyclic languages and strongly cyclic languages , STACS 96 (Grenoble, 1996), 49–59, Lecture Notes in Computer Science, 1046, Springer, Berlin, 1996.

R. Mantaci, C. R., A generalization of Solomon's algebra for hyperoctahedral groups and other wreath products Communivations in Algebra 23 (1995), no. 1, 27–56.

C. R., On symmetric functions related to Witt vectors and the free Lie algebra , Advances in Mathematics 110 (1995), no. 2, 234–246.

S. Poirier, C. R., Algèbres de Hopf de tableaux , [Hopf algebras of tableaux] Annales des Sciences Mathéamatiques du Québec 19 (1995), no. 1, 79–90.

C. R., M.-P. Schützenberger, Variétés et fonctions rationnelles , [Varieties and rational functions] Theoretical Computer Science 145 (1995), no. 1-2, 229–240.

C. Malvenuto, C. R., Duality between quasi-symmetric functions and the Solomon descent algebra , Journal of Algebra 177 (1995), no. 3, 967–982.

P. M. Cohn, C. R., A normal form in free fields , Canad. Journal Mathematics 46 (1994), no. 3, 517–531.

C. Malvenuto, C. R., Evacuation of labelled graphs , Discrete Mathematics 132 (1994), no. 1-3, 137–143.

C. R., Free Lie algebras. London Mathematical Society Monographs. New Series, 7. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1993. xviii+269 pp. ISBN: 0-19-853679-8.

G. Melançon, C. R., Computing Hall exponents in the free group , International Journal of Algebra and Computing 3 (1993), no. 3, 275–294.

I. Gessel, C. R., Counting permutations with given cycle structure and descent set , Journal of Combinatorial Theory Series A 64 (1993), no. 2, 189–215.

C. R., Applications of a noncommutative Jacobian matrix , Journal of Pure and Applied Algebra 77 (1992), no. 2, 169–181.

C. R., M.-P. Schützenberger, Rational word functions: characterization and minimization, Words, languages and combinatorics (Kyoto, 1990), 435–443, World Scientific Publisher, River Edge, NJ, 1992.

A. Björner, C. R., Rationality of the Möbius function of subword order , Second Workshop on Algebraic and Computer-theoretic Aspects of Formal Power Series (Paris, 1990). Theoretical Computer Science 98 (1992), no. 1, 53–63.

F. Bergeron, A. Garsia, C. R., Homomorphisms between Solomon's descent algebras , J. Algebra 150 (1992), no. 2, 503–519.

G. Melançon, C. R., Une présentation combinatoire de la super-algèbre de Lie libre. (French) [A combinatorial presentation of the free Lie superalgebra] C. R. Acad. Sci. Paris Sér. I Math. 315 (1992), no. 12, 1215–1220.

C. R., Sur des fonctions symétriques reliées aux vecteurs de Witt. (French) [On symmetric functions related to Witt vectors] C. R. Acad. Sci. Paris Sér. I Math. 312 (1991), no. 7, 487–490.

Reutenauer, M-P. Schützenberger, Minimization of rational word functions , SIAM Journal of Computing 20 (1991), no. 4, 669–685.

J.-E. Pin, C. R., A conjecture on the Hall topology for the free group , Bulletin of the London Mathematical Society 23 (1991), no. 4, 356–362.

J. Berstel, C. R., Rational series and their languages. EATCS Monographs on Theoretical Computer Science, 12. Springer-Verlag, Berlin, 1988. viii+151 pp. ISBN: 3-540-18626-3.

C. R., The mathematics of Petri nets. Translated from the French by Iain Craig. Prentice Hall International, Hemel Hempstead; Masson, Paris, 1990. x+117 pp. ISBN: 0-13-561887-8.

F. Bergeron, C. R., Combinatorial resolution of systems of differential equations III. A special class of differentially algebraic series, European J. Combin. 11 (1990), no. 6, 501–512.
C. R., Subsequential functions: characterizations, minimization, examples , Aspects and prospects of theoretical computer science (Smolenice, 1990), 62–79, Lecture Notes in Computer Science, 464, Springer, Berlin, 1990.

C. R., Number of permutations with given descent set and cycle structure. Séminaire Lotharingien de Combinatoire (Oberfranken, 1990), 99–110, Publications de l'Institut de Recherches Mathématiques Avancées, 413, Univ. Louis Pasteur, Strasbourg, 1990.

C. R., Dimensions and characters of the derived series of the free Lie algebra , Mots, 171–184, Lang. Raison. Calc., Hermès, Paris, 1990.

A. Garsia, C. R., A decomposition of Solomon's descent algebra, Advances in Mathematics 77 (1989), no. 2, 189–262.
Guy Melançon, C. R., Lyndon words, free algebras and shuffles, Canadian Journal of Mathematics 41 (1989), no. 4, 577–591.
C. R., Noncommuting variables: I. Finite automata, II. Rational generating series, III. Realization of bilinear systems, Encyclopedia of Systems and Control, (M.SINGH, editeur), Pergamon Press, 1988, 3268-3279.
J. Berstel, C. R., Rational series and their languages. EATCS Monographs on Theoretical Computer Science, 12. Springer-Verlag, Berlin, 1988. viii+151 pp. ISBN: 3-540-18626-3.
C. R., Mots circulaires et polynômes irréductibles, Ann. Sci. Math. Québec 12 (1988), no. 2, 275-285.
J. Berstel, C. R., Zeta functions of recognizable languages. Automata, languages and programming (Tampere, 1988), 93–104, Lecture Notes in Comput. Sci., 317, Springer, Berlin, 1988.
C. R., Aspects mathématiques des réseau de Petri, Études et Recherches en Informatique. [Studies and Research in Computer Science] Masson, Paris, 1988. 117 pp. ISBN: 2-225-81492-9.
C. R., Algorithmes et problèmes indécidables, 1987.
C. R., M.-P. Schützenberger, A formula for the determinant of a sum of matrices, Lett. Math. Phys. 13 (1987), no. 4, 299–302.
F. Bergeron, C. R., Une interprétation combinatoire des puissances d'un opérateur différentiel linéaire, Ann. Sci. Math. Québec 11 (1987), no. 2, 269–278.
C. De Felice, C. R., Solution partielle de la conjecture de factorisation des codes. [Partial solution of the factorization conjecture for codes] C. R. Acad. Sci. Paris Sér. I Math. 302 (1986), no. 5, 169–170.
C. R., Ensembles libres de chemins dans un graphe, Bulletin Société Mathématique de France 114 (1986), no. 2, 135–152.
C. R., The local realization of generating series of finite Lie rank. Algebraic and geometric methods in nonlinear control theory, 33–43, Math. Appl., 29, Reidel, Dordrecht, 1986.
C. R., Mots de Lyndon et un théorème de Shirshov, Annales Sciences Mathématiques du Québec 10 (1986), no. 2, 237–245.
C. R., Theorem of Poincaré-Birkhoff-Witt, logarithm and symmetric group representations of degrees equal to Stirling numbers , Combinatoire énumérative (Montreal, Que., 1985/Quebec, Que., 1985), 267–284, Lecture Notes in Math., 1234, Springer, Berlin, 1986.

C. R., The shuffle algebra on the factors of a word is free, J. Combin. Theory Ser. A 38 (1985), no. 1, 48–57.
C. R., Noncommutative factorization of variable-length codes, Journal of Pure and Applied Algebra 36 (1985), no. 2, 167–186.
C. R., Sur les semi-groupes vérifiant le théorème de Kleene, RAIRO Informatique Théorique 19 (1985), no. 3, 281–291.
A. Restivo, C. R., Rational languages and the Burnside problem, Theoretical Computer Science 40, 1985, 13-30.
C. R., Recent results on codes. Fundamentals of computation theory (Cottbus, 1985), 351–360, Lecture Notes in Comput. Sci., 199, Springer, Berlin, 1985.
J. Berstel, C. R., Les séries rationnelles et leurs langages [Rational power series and their languages], Études et Recherches en Informatique. [Studies and Research in Computer Science] Masson, Paris, 1984. 132 pp. ISBN: 2-225-80137-1
C. R., H. Straubing Inversion of matrices over a commutative semiring, Journal of Algebra 88 (1984), 350-360.
A. Restivo, C. R., On the Burnside problem for semigroups, Journal of Algebra 89 (1984), 102-104.
G. Hansel, D. Perrin, C. R., Factorizing the polynomial of a code., Transactions of the American Mathematical Society 285 (1984), 91-105.
G. Jacob, C. R., On formal power series defined by infinite linear systems., Theoretical Computer Science 32 (1984), no. 3, 339-340.
A. Restivo, C. R., On cancellation properties of languages which are supports of rational power series, J. Computer and System Sciences 29 (1984), no. 2, 153–159.
C. R., Cancellation, pumping and permutation in formal languages. Automata, languages and programming (Antwerp, 1984), 414–422, Lecture Notes in Comput. Sci., 172, Springer, Berlin, 1984.
C. R., Sur un théorème de Schützenberger, Note aux Comptes Rendus de l'Académie des Sciences, Paris, A296, 619-621, 1983.
C. R., Cyclic derivation of noncommutative algebraic power series, Journal of Algebra, 85, 32-39, 1983.
C. R., Sulla fattorizzazione dei codici, Ricerche di Matematica 32, 115-130, 1983.
A. Restivo, C. R., Some applications of a theorem of Shirshov to language theory, Information and Control 57 (1983), no. 2-3, 205–213.
M. Fliess, C. R., Théorie de Picard-Vessiot des systèmes réguliers (ou bilinéaires), (French) [Picard-Vessiot theory for regular (or bilinear) systems] Mathematical tools and models for control, systems analysis and signal processing, Vol. 3 (Toulouse/Paris, 1981/1982), 557–581, Travaux Rech. Coop. Programme 567, CNRS, Paris, 1983.
J. Berstel, C. R., Recognizable formal power series on trees, Theoretical Computer Science 18 (1982), no. 2, 115–148.
C. R., Sur les éléments inversibles de l'algèbre de Hadamard des séries rationnelles, [The invertible elements of the Hadamard algebra of rational power series] Bulletin de la Société Mathématique de France 110 (1982), no. 3, 225–232.
M. Fliess, C. R., Une application de l'algèbre différentielle aux systèmes réguliers (ou bilinéaires), [An application of differential algebra to regular (or bilinear) systems] Analysis and optimization of systems (Versailles, 1982), 99–110, Lecture Notes in Control and Inform. Sci., 44, Springer, Berlin, 1982.
C. R., Biprefix codes and semisimple algebras. Automata, languages and programming (Aarhus, 1982), pp. 451–457, Lecture Notes in Comput. Sci., 140, Springer, Berlin-New York, 1982.
C. R., Sur mon article "une topologie du monoïde libre", Semigroup Forum, 22, 93-95, 1981.
C. R., Semisimplicity of the algebra associated to a biprefix code, Semigroup Forum, 23, 327-342, 1981.
C. R., Propriétés arithmétiques de séries rationnelles et ensembles denses, Acta Arithmetica, 39, 133-144, 1981.
C. R., Point générique du plus petit groupe algébrique dont l'algèbre de Lie contient plusieurs matrices données, Note aux Comptes Rendus de l'Académie des Sciences, Paris, A293, 577-580, 1981.
C. R., Intégrations des codes bipréfixes (d'après Césari), Séminaire d'Informatique Théorique, Année 1981/1982, Séance du 30 octobre 1981, Institut de programmation, Laboratoire associé au CNRS 248.
C. R., Sur l'algèbre associée à un code bipréfixe, Note aux Comptes Rendus de l'Académie des Sciences, Paris, A292, 11-13, 1981.
C. R., Séries formelles et algèbres syntactiques, Journal of Algebra, 66, 448-483, 1980.
C. R., An Ogden-Like Iteration Lemma for rational Power Series, Acta Informatica, 13, 189-197, 1980.
J. Berstel, C. R., Séries formelles reconnaissables d'arbres et applications, Trees in algebra and programming (Proc. 5th Lille Colloq., Lille, 1980), pp. 11–21, Univ. Lille I, Lille, 1980.
C. R., Une topologie du monoïde libre, Semigroup Forum, 18, 33-49, 1979.
C. R., Sur les séries associées à certains systèmes de Lindenmayer, Theoretical Computer Science, 9, 363-375, 1979.
C. R., On Pólya series in noncommuting variables. Fundamentals of computation theory (Proc. Conf. Algebraic, Arith. and Categorical Methods in Comput. Theory, Berlin/Wendisch-Rietz, 1979), pp. 391–396, Math. Res., 2, Akademie-Verlag, Berlin, 1979.
C. R., Sur les variétés de langages et de monoïdes, Theoretical computer science (Fourth GI Conf., Aachen, 1979), pp. 260–265, Lecture Notes in Comput. Sci., 67, Springer, Berlin-New York, 1979.
C. R., Propriétés "à la Fatou'' des séries rationnelles, Séries formelles en variables non commutatives et applications (Actes 5e École de Printemps Informat. Théorique, Vieux-Boucau les Bains, 1977), pp. 251–260, École Nat. Sup. Tech. Avancées, Paris, 1978.
C. R., Une caractérisation des anneaux de Fatou faibles, Note aux Comptes Rendus de l'Académie des Sciences, Paris, A287, 295-296, 1978.
C. R., Une bibliographie sur les séries en variables non commutatives, Séries formelles en variables non commutatives et applications (Actes 5e École de Printemps Informat. Théorique, Vieux-Boucau les Bains, 1977), pp. 251–260, École Nat. Sup. Tech. Avancées, Paris, 1978.
C. R., Sur les séries rationnelles en variables non commutatives, Automata, languages and programming (Fifth Internat. Colloq., Udine, 1978), pp. 372–381, Lecture Notes in Comput. Sci., 62, Springer, Berlin-New York, 1978.
C. R., On a question of Eilenberg, Theoretical Computer Science, 5, 219, 1977.
C. R., Une caractérisation de la finitude de l'ensemble des coefficients d'une série rationelle en plusieurs variables non commutatives, Note aux Comptes Rendus de l'Académie des Sciences, Paris, A284, 1159-1162, 1977.