1. Shuffle series
- Author
-
Ahmad, Khushdil, Dolores-Cuenca, Eric Rubiel, and Shabbir, Khurram
- Subjects
Mathematics - Combinatorics ,Mathematics - Algebraic Topology ,05A15 (Primary) 18M80, 05A10, 06A11 - Abstract
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
- Published
- 2023