Related papers: Forests and the W Construction

A new hierarchy of operads over the linear spans of $\delta$-cliffs, which are some words of integers, is introduced. These operads are intended to be analogues of the operad of permutations, also known as the associative symmetric operad.…

We introduce a functor ${\sf As}$ from the category of posets to the category of nonsymmetric binary and quadratic operads, establishing a new connection between these two categories. Each operad obtained by the construction ${\sf As}$…

A set of points with finite density is constructed in $\mathbb{R}^d$, with $d\geq2$, by adding points to a Poisson process such that any line segment of length $O\left(\varepsilon^{-(d-1)}\ln\varepsilon^{-1}\right)$ in $\mathbb{R}^d$ will…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

We introduce the condensed fiber product of two $G$-crossed braided fusion categories, generalizing existing constructions in the literature. We show that this product is closely related to the cohomological construction known as zesting.…

We show how to treat families of $\infty$-categories fibered in categorical patterns (e.g., $\infty$-operads and monoidal $\infty$-categories) in terms of fibrations by relativizing the Grothendieck construction. As applications, we…

We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to…

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 prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…

We continue our study of ordered context-free grammars, a grammar formalism that places an order on the parse trees produced by the corresponding context-free grammar. In particular, we simplify our previous definition of a derivation of a…

We introduce a construction that associates, to each finite dimensional k-vector space V, a family of projective k-varieties that comes equipped with the structure of a operad in the category of k-schemes. When dim V = 1, this operad…

We describe a Grothendieck construction for non-symmetric operads with values in categories, and hence in groupoids and posets. The construction produces a 2-category which is operadically fibered over the category D of finite non-empty…

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 give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…

Let $\cT$ be a monadic-second order class of finite trees, and let $\bT(x)$ be its (ordinary) generating function, with radius of convergence $\rho$. If $\rho \ge 1$ then $\cT$ has an explicit specification (without using recursion) in…

We construct composite operators in two-dimensional bosonized QCD, which obey a $W_\infty$ algebra, and discuss their relation to analogous objects recently obtained in the fermionic language. A complex algebraic structure is unravelled,…

A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a…

We show that it is decidable whether a given a regular tree language belongs to the class ${\bf \Delta^0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.

Since the seminal work of Ambrosetti and Prodi, the study of global folds was enriched by geometric concepts and extensions accomodating new examples. We present the advantages of considering fibers, a construction dating to Berger and…