Analytic aspects of the shuffle product

There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences, we find that the shuffle product models many key aspects of D-finite generating functions, a class which contains algebraic. We consider several different takes on the shuffle product, shuffle closure, and shuffle grammars, and give explicit generating function consequences. In the process, we define a grammar class that models D-finite generating functions.

[1]  L. Lipshitz,et al.  The diagonal of a D-finite power series is D-finite , 1988 .

[2]  Michael F. Singer,et al.  Algebraic relations among solutions of linear di erential equations , 1986 .

[3]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[4]  Marni Mishna,et al.  Effective scalar products of D-finite symmetric functions , 2005, J. Comb. Theory, Ser. A.

[5]  Philippe Flajolet,et al.  Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

[6]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[7]  Marni Mishna.  Automatic Enumeration of Regular Objects , 2005 .

[8]  François Bergeron,et al.  Combinatorial Resolution of Systems of Differential Equations III: a Special Class of Differentially Algebraic Series , 1990, Eur. J. Comb..

[9]  D. Greene.  Labelled formal languages and their uses , 1983 .

[10]  Christophe Paul,et al.  Perfect Sorting by Reversals Is Not Always Difficult , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[11]  M. Bousquet-M'elou.  Rational and algebraic series in combinatorial enumeration , 2008, 0805.0588.

[12]  Matthias Jantzen,et al.  Extending Regular Expressions with Iterated Shuffle , 1985, Theor. Comput. Sci..

[13]  Gilbert Labelle,et al.  Combinatorial species and tree-like structures , 1997, Encyclopedia of mathematics and its applications.

[14]  Jay L. Gischer.  Shuffle languages, Petri nets, and context-sensitive grammars , 1981, CACM.

[15]  Philippe Flajolet,et al.  AN INVITATION TO ANALYTIC COMBINATORICS , 2009 .

[16]  M. Lothaire.  Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .

[17]  Manuel Bodirsky,et al.  An unbiased pointing operator for unlabeled structures, with applications to counting and sampling , 2007, SODA '07.

[18]  Ulrike Sattler,et al.  Constructible Differentially Finite Algebraic Series in Several Variables , 1995, Theor. Comput. Sci..

[19]  Lee A. Rubel,et al.  A survey of transcendentally transcendental functions , 1989 .

[21]  Joanna Jedrzejowicz.  Infinite Hierarchy of Expressions Containing Shuffle Closure Operator , 1988, Inf. Process. Lett..

[22]  Philippe Flajolet,et al.  Analytic Models and Ambiguity of Context-free Languages* , 2022 .

[23]  Mireille Bousquet-Mélou,et al.  Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages , 2005, STACS.

[24]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[25]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .