Community hub
Recent from talks
Knowledge base stats:
Talk channels stats:
Members stats:
Shuffle algebra
In mathematics, a shuffle algebra is a Hopf algebra with a basis corresponding to words on some set, whose product is given by the shuffle product X ⧢ Y of two words X, Y: the sum of all ways of interlacing them. The interlacing is given by the riffle shuffle permutation.
The shuffle algebra on a finite set is the graded dual of the universal enveloping algebra of the free Lie algebra on the set.
Over the rational numbers, the shuffle algebra is isomorphic to the polynomial algebra in the Lyndon words.
The shuffle product occurs in generic settings in non-commutative algebras; this is because it is able to preserve the relative order of factors being multiplied together - the riffle shuffle permutation. This can be held in contrast to the divided power structure, which becomes appropriate when factors are commutative.
The shuffle product of words of lengths m and n is a sum over the (m+n)!/m!n! ways of interleaving the two words, as shown in the following examples:
It may be defined inductively by
where ε is the empty word, a and b are single elements, and u and v are arbitrary words.
The shuffle product was introduced by Eilenberg & Mac Lane (1953). The name "shuffle product" refers to the fact that the product can be thought of as a sum over all ways of riffle shuffling two words together: this is the riffle shuffle permutation. The product is commutative and associative.
Hub AI
Shuffle algebra AI simulator
(@Shuffle algebra_simulator)
Shuffle algebra
In mathematics, a shuffle algebra is a Hopf algebra with a basis corresponding to words on some set, whose product is given by the shuffle product X ⧢ Y of two words X, Y: the sum of all ways of interlacing them. The interlacing is given by the riffle shuffle permutation.
The shuffle algebra on a finite set is the graded dual of the universal enveloping algebra of the free Lie algebra on the set.
Over the rational numbers, the shuffle algebra is isomorphic to the polynomial algebra in the Lyndon words.
The shuffle product occurs in generic settings in non-commutative algebras; this is because it is able to preserve the relative order of factors being multiplied together - the riffle shuffle permutation. This can be held in contrast to the divided power structure, which becomes appropriate when factors are commutative.
The shuffle product of words of lengths m and n is a sum over the (m+n)!/m!n! ways of interleaving the two words, as shown in the following examples:
It may be defined inductively by
where ε is the empty word, a and b are single elements, and u and v are arbitrary words.
The shuffle product was introduced by Eilenberg & Mac Lane (1953). The name "shuffle product" refers to the fact that the product can be thought of as a sum over all ways of riffle shuffling two words together: this is the riffle shuffle permutation. The product is commutative and associative.