Related papers: Forests and the W Construction
In this paper we study the homology of 2 versions of the swiss-cheese operad. We prove that the zeroth homology of these two versions are Koszul operads and relate this to strong homotopy Lebiniz pairs and OCHA, defined by Kajiura and…
Many examples of obstruction theory can be formulated as the study of when a lift exists in a commutative square. Typically, one of the maps is a cofibration of some sort and the opposite map is a fibration, and there is a functorial…
This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
We prove that if a pair of semi-cosimplicial spaces (X,Y) arise from a coloured operad then the semi-totalization sTot(Y) has the homotopy type of a relative double loop space and the pair (sTot(X),sTot(Y)) is weakly equivalent to an…
We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant relation or…
For a discrete colored operad $P$, we construct an adjunction between the category of dendroidal sets over the nerve of $P$ and the category of simplicial $P$-algebras, and prove that when $P$ is $\Sigma$-free it establishes a Quillen…
Let $W$ be a $2$-dimensional Coxeter group, that is, a one with $\frac{1}{m_{st}}+\frac{1}{m_{sr}}+\frac{1}{m_{tr}}\leq 1$ for all triples of distinct $s,t,r\in S$. We prove that $W$ is biautomatic. We do it by showing that a natural…
Existing ordinal trees and random forests typically use scores that are assigned to the ordered categories, which implies that a higher scale level is used. Versions of ordinal trees are proposed that take the scale level seriously and…
We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is…
We study categorial properties of the operadic twisting functor Tw. In particular, we show that Tw is a comonad. Coalgebras of this comonad are operads for which a natural notion of twisting by Maurer-Cartan elements exists. We give a large…
Bestvina and Feighn showed that a morphism S --> T between two simplicial trees that commutes with the action of a group G can be written as a product of elementary folding operations. Here a more general morphism between simplicial trees…
It was shown in \cite{sc12} that for a certain class of structures $\I$, $\I$-indexed indiscernible sets have the modeling property just in case the age of $\I$ is a Ramsey class. We expand this known class of structures from ordered…
Finding the set of leaves for an unbounded tree is a nontrivial process in both the Weihrauch and reverse mathematics settings. Despite this, many combinatorial principles for trees are equivalent to their restrictions to trees with leaf…
A new very simple proof of the number of labeled rooted forest-graphs with a given number of vertices is given. As a partial case of this formula we have Cayley's formula.
An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.
We show that the category of algebraically cofibrant objects in a combinatorial and simplicial model category A has a model structure that is left-induced from that on A. In particular it follows that any presentable model category is…
K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…
We study the notion of a bifibration in simplicial sets which generalizes the classical notion of two-sided discrete fibration studied in category theory. If $A$ and $B$ are simplicial sets we equip the category of simplicial sets over…
The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szemer\'edi's regularity lemma) got increasingly studied over the past $10$ years. Recently,…