Related papers: Partition complexes and trees
We construct a category of fibrant objects $\mathbb{C}\langle P\rangle$ in the sense of K. Brown from any indexed frame (a kind of indexed poset generalizing triposes) $P$, and show that its homotopy category is the Barr-exact category…
For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…
We produce a canonical highly homotopy-coherent operad structure on the derivatives of the identity functor in spaces via a pairing of cosimplicial objects, providing a new description of an operad structure on such objects first described…
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…
We introduce two definitions of $G$-equivariant partitions of a finite $G$-set, both of which yield $G$-equivariant partition complexes. By considering suitable notions of equivariant trees, we show that $G$-equivariant partitions and…
In this paper we study a category of trees TI and prove that it is a Koszul category. Consequences are the interpretation of the reduced bar construction of operads of Ginzburg and Kapranov as the Koszul complex of this category, and the…
We endow the category of bialgebras over a pair of operads in distribution with a cofibrantly generated model category structure. We work in the category of chain complexes over a field of characteristic zero. We split our construction in…
Using the ordered analogue of Farley-Sabalka's discrete gradient field on the configuration space of a graph, we unravel a levelwise behavior of the generators of the pure braid group on a tree. This allows us to generalize Farber's…
We develop a categorical framework for reasoning about abstract properties of differentiation, based on the theory of fibrations. Our work encompasses the first-order fragments of several existing categorical structures for differentiation,…
Classification questions are often about understanding components of a category. It is much more desirable however to be able to understand the entire homotopy type of this category and not just the set of its components. In this paper we…
We construct an explicit minimal model for an algebra over the cobar-construction of a differential graded operad. The structure maps of this minimal model are expressed in terms of sums over decorated trees. We introduce the appropriate…
The goal of this memoir is to prove that the bar complex B(A) of an E-infinity algebra A is equipped with the structure of a Hopf E-infinity algebra, functorially in A. We observe in addition that such a structure is homotopically unique…
We define a natural 2-categorical structure on the base category of a large class of Grothendieck fibrations. Given any model category $\mathbf{C}$, we apply this construction to a fibration whose fibers are the homotopy categories of the…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…
We construct a category $\OrdFor$ as an arboreal extension of $\Delta_{\mathrm{epi}}\subseteq\Delta$, whose morphisms are ordered forests composed by grafting. We define a full functor $\pi\colon \OrdFor\to\Delta_{\mathrm{epi}}^{op}$…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…