4 citations · 8 across the 8 of their papers we have counts for
8 papers
Generalised flip order on the faces of nestohedra
Pierre-Louis Curien, Bérénice Delcroix-Oger, Jovana Obradović
Tamari lattices and weak Bruhat order are classical posets on the vertices of associahedra and permutohedra. These posets are particular instances of the \emph{flip order} on the v…
Tridendriform algebras on hypergraph polytopes, the other way around
Pierre-Louis Curien, Bérénice Delcroix-Oger, Jovana Obradović
Hypergraph polytopes (or nestohedra) form a broad class of polytopes obtained by truncating faces of a simplex according to a hypergraph. In earlier work, the authors constructed q…
The Bénabou-Roubaud theorem via string diagrams
Jovana Obradović
We give a complete proof of the Bénabou-Roubaud monadic descent theorem using the graphical calculus of string diagrams. Our proof links the monadic and Grothendieck's original vie…
Tridendriform algebras on hypergraph polytopes
Pierre-Louis Curien, Bérénice Delcroix-Oger, Jovana Obradović
We extend the works of Loday-Ronco and Burgunder-Ronco on the tridendriform decomposition of the shuffle product on the faces of associahedra and permutohedra, to other families of…
Minimal models for graph-related (hyper)operads
Michael Batanin, Martin Markl, Jovana Obradović
We construct explicit minimal models for the (hyper)operads governing modular, cyclic and ordinary operads, and wheeled properads, respectively. Algebras for these models are homot…
Combinatorial homotopy theory for operads
Jovana Obradović
We introduce an explicit combinatorial characterization of the minimal model of the coloured operad encoding non-symmetric operads. In our descriptio…
Monoid-like definitions of cyclic operads
Jovana Obradović
Guided by the microcosm principle of Baez-Dolan and by the algebraic definitions of operads of Kelly and Fiore, we introduce two "monoid-like" definitions of cyclic operads, one fo…
A formal language for cyclic operads
Pierre-Louis Curien, Jovana Obradović
We propose a -calculus-style formal language, called the -syntax, as a lightweight representation of the structure of cyclic operads. We illustrate the rewriting methods behi…