分野別セミナー

Let be the linear order 1<2<... defines a binary operation (,) ->. In this talk we
describe three ways to extend the riffle shuffle of linear orders to a
shuffle on the pair (T,L) where T is a series parallel poset and L is
a linear order.
For a given series parallel poset, and any of these three shuffles,
there is a polynomial f_i, i=1,2,3, such that f_i(n) is the number of
shuffles between the poset and . Using operad theory and sets with
negative number of elements we compute the generating functions of
f_1, f_2 and f_3, they are called shuffle series.
Our work introduces a new order series and our results are applied to
the study of the tensor product of operads of trees.

URL: https://sites.google.com/view/mathpolynomial