Related papers: Broad posets, trees, and the dendroidal category
We introduce the concept of a dendroidal set. This is a generalization of the notion of a simplicial set, specially suited to the study of operads in the context of homotopy theory. We define a category of trees, which extends the category…
Dendroidal sets offer a formalism for the study of $\infty$-operads akin to the formalism of $\infty$-categories by means of simplicial sets. We present here an account of the current state of the theory while placing it in the context of…
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…
The homotopy theory of infinity-operads is defined by extending Joyal's homotopy theory of infinity-categories to the category of dendroidal sets. We prove that the category of dendroidal sets is endowed with a model category structure…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
The category of dendroidal sets is an extension of that of simplicial sets, suitable for defining nerves of operads rather than just of categories. In this paper, we prove some basic properties of inner Kan complexes in the category of…
Dendroidal sets have been introduced as a combinatorial model for homotopy coherent operads. We introduce the notion of fully Kan dendroidal sets and show that there is a model structure on the category of dendroidal sets with fibrant…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
We prove that the category of trees $\Omega$ is a test category in the sense of Grothendieck. This implies that the category of dendroidal sets is endowed with the structure of a model category Quillen-equivalent to spaces. We show that…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
We discuss the combinatorics of faces of trees in the context of dendroidal sets and develop a systematic treatment of dendroidal anodyne extensions. As the main example and our motivation, we prove the pushout-product property for the…
We present here definitions and constructions basic for the theory of monoidal and tensor categories. We provide references to the original sources, whenever possible. Group-theoretical categories are used as examples
We present an overview of some recent developments in the theory of generalized formal series, grounded in diffeological geometric framework. These constructions aim to offer new tools for understanding infinite-dimensional phenomena in…
The development of mathematics has been characterized by the increasing interconnectivity of seemingly separate disciplines. Such interplay has been facilitated by a massive development in formalism; category theory has provided a common…
We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
Questions of set-theoretic size play an essential role in category theory, especially the distinction between sets and proper classes (or small sets and large sets). There are many different ways to formalize this, and which choice is made…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
We give an explicit description of the rigidification of an $\infty$-operad as a simplicial operad. This description is based on the notion of dendroidal necklace, extending work of Dugger and Spivak from the categorical context to the…