2000 character limit reached
Word operads and admissible orderings
Published 9 Jul 2019 in math.CT, math.CO, and math.KT | (1907.03992v1)
Abstract: We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is utilised to exhibit a quadratic Gr\"obner basis of the Poisson operad.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
