Papers
Topics
Authors
Recent
Search
2000 character limit reached

The fibration sequences of the lattice path operad

Published 19 Mar 2025 in math.AT | (2503.15179v1)

Abstract: We introduce a notion of an operad of complexity $m$, for $m \geq 1$. Operads of complexity $1$ are monoids in the category of $\mathbb{N}$-indexed collections, with monoidal product given by the Day convolution, and operads of complexity $2$ are non-symmetric operads. In general, we prove that the operad for operads of complexity $m$ is a suboperad of the $m$-th stage filtration of the lattice path operad introduced by Batanin and Berger. Finally, we exhibit fibration sequences involving this new notion, extending the results of Turchin and Dwyer-Hess.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.