2000 character limit reached
Shuffles of trees (1705.03638v1)
Published 10 May 2017 in math.CO and math.AT
Abstract: We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize shuffles in terms of open sets in a topological space associated to a pair of trees. Our notion of shuffle is motivated by the theory of operads and occurs in the theory of dendroidal sets, but our presentation is independent and entirely self-contained.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
