Shuffle product of generating series
\textit{G. Jacob} [Sur le produit de mélange, Technical report, Laboratoire d'Informatique de Lille, n. IT-142, Université de Lille I (1988)] has expressed, through the notion of substitution, the analytic and recurrent expression of the shuffle product of two noncommutative formal power series. The aim of the present paper is to give a shorter proof of Jacob's result based on the use of the Kronecker shuffle. As the author points out this leads to directly off-line-computable linear operators which allow the resulting series to be determined in a very simple way.
- Shuffle product of finite multiple polylogarithms
- The mechanics of shuffle products and their siblings
- Shuffles of permutations and the Kronecker product
- The expressive power of the shuffle product
- Analytic aspects of the shuffle product
- Inverse for the shuffle for algebraic series
- Shuffle product formulas of multiple zeta values
- Quasi-shuffle products
- scientific article; zbMATH DE number 5234333
- scientific article; zbMATH DE number 1504604
- Sufficient conditions for local controllability and high-order necessary conditions for optimality. A differential-geometric approach.
- Inverse for the shuffle for algebraic series
- Geometrical and topological methods in optimal control theory
- On the Hurwitz product of formal power series and automata
- Analytic aspects of the shuffle product
- On exponentials of exponential generating series
This page was built for publication: Shuffle product of generating series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644740)
