We apply operad theory to enumerative combinatorics in order to count the number of shuffles between series–parallel posets and chains. We work with three types of shuffles, two of them noncommutative; for example, a left deck-divider shuffle A between P and Q is a shuffle of the posets in which, on every maximal chain \(m\subset A\) , the minimum and maximum elements belong to P and no two consecutive points of Q appear consecutively on m. The number of left deck-divider shuffles of P and Q differ from the number of left deck-divider shuffles of Q and P. The generating functions whose n coefficient counts shuffles between a poset P and \(1<2<\cdots <n\) are called shuffle series. We explain how shuffle series are isomorphic to order series as algebras over the operad of series parallel posets. The weak and strict order polynomials are well known in the literature. At the level of generating series, with the theory of sets with a negative number of elements, we introduce a third-order series and prove a theorem in the style of Stanley’s Reciprocity Theorem compatible with the structure of algebras over the operad of finite posets. We conclude by describing the relationship of our work with the combinatorial properties of the operadic tensor product of free trees operads.
