Related papers: Partition complexes and trees
In classical set theory, there are many equivalent ways to introduce ordinals. In a constructive setting, however, the different notions split apart, with different advantages and disadvantages for each. We consider three different notions…
We compute the characteristic polynomials of the posets of hypertrees. We show that the generating series of the polynomials can be expressed using cyclic hypertrees. We also propose a conjecture on the action of the symmetric groups on the…
The goal of the present paper is to compare, in a precise way, two notions of operads up to homotopy which appear in the literature. Namely, we construct a functor from the category of strict unital homotopy colored operads to the category…
We prove an equivalence of categories from formal complex structures with formal holomorphic maps to homotopy algebras over a simple operad with its associated homotopy morphisms. We extend this equivalence to complex manifolds. A complex…
We give a construction of triangulated categories as quotients of exact categories where the subclass of objects sent to zero is defined by a triple of functors. This includes the cases of homotopy and stable module categories. These…
Motivated by its link with functor homology, we study the prop freely generated by the operadic suspension of the operad Com. We exhibit a particular family of generators, for which the composition and the symmetric group actions admit…
We study the splitting of the Goodwillie towers of functors in various settings. In particular, we produce splitting criteria for functors $F: \A \to M_A$ from a pointed category with coproducts to $A$-modules in terms of differentials of…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
The purpose of this paper is twofold. First, we review applications of the bar duality of operads to the construction of explicit cofibrant replacements in categories of algebras over an operad. In view toward applications, we check that…
We show that the free construction from multicategories to permutative categories is a categorically-enriched non-symmetric multifunctor. Our main result then shows that the induced functor between categories of algebras is an equivalence…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
For an abelian category, a category equivalent to its derived category is constructed by means of specific projective (injective) multicomplexes, the so-called homological resolutions.
The question whether a partition $\mathcal{P}$ and a hierarchy $\mathcal{H}$ or a tree-like split system $\mathfrak{S}$ are compatible naturally arises in a wide range of classification problems. In the setting of phylogenetic trees, one…
This text gives a construction of a differential graded Lie algebra in Nori's category of effective homological motives. In fact the construction works in more a general setting than that of an Abelian category. This allows us to give the…
We construct combinatorial model category structures on the categories of (marked) categories and (marked) pre-additive categories, and we characterize (marked) additive categories as fibrant objects in a Bousfield localization of…
This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The development in this paper…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those algorithms in the literature often obscures the essence of…