Related papers: Forests and the W Construction
In a previous work, we gave a coalgebraic framework of directed graphs equipped with weights (or probability vectors) in terms of (Markov) L-coalgebras. They are K-vector spaces equipped with two co-operations, \Delta_M, \tilde{\Delta}_M…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…
This paper explicitely constructs cofree coalgebras over operads in the category of DG-modules. Special cases are considered in which the general expression simplifies (such as the pointed, irreducible case). It is shown that the existence…
First we define a unification grammar formalism called the Tree Homomorphic Feature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this…
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes…
Given an involutive automorphism $\theta$ of a Coxeter system $(W,S)$, let $\mathfrak{I}(\theta) \subseteq W$ denote the set of twisted involutions. We provide a minimal set of moves that can be added to the braid moves, in order to connect…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with…
We study the weighted composition operators between the Lipschitz space and the space of bounded functions on the set of vertices of an infinite tree. We characterized the boundedness, the compactness, and the boundedness from below of…
We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…
We develop a finite-sample, design-based theory for random forests in which each tree is a randomized conditional predictor acting on fixed covariates and the forest is their Monte Carlo average. An exact variance identity separates Monte…
A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific…
The word problem for categories with free products and coproducts (sums), SP-categories, is directly related to the problem of determining the equivalence of certain processes. Indeed, the maps in these categories may be directly…
In this note, we classify all the weighted oriented forests whose edge ideals have the property that one of their matching powers has linear resolution.
This work studies the statistical implications of using features comprised of general linear combinations of covariates to partition the data in randomized decision tree and forest regression algorithms. Using random tessellation theory in…
The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…
Waldhausen's $S_\bullet$-construction gives a way to define the algebraic $K$-theory space of a category with cofibrations. Specifically, the $K$-theory space of a category with cofibrations $\mathcal{C}$ can be defined as the loop space of…
Consider a cofibrantly generated model category $S$, a small category $C$ and a subcategory $D$ of $C$. We endow the category $S^C$ of functors from $C$ to $S$ with a model structure, defining weak equivalences and fibrations objectwise but…
We introduce unary operadic 2-categories as a framework for operadic Grothendieck construction for categorical $\mathbb{O}$-operads, $\mathbb{O}$ being a unary operadic category. The construction is a fully faithful functor…
We introduce notions of open-string vertex algebra, conformal open-string vertex algebra and variants of these notions. These are ``open-string-theoretic,'' ``noncommutative'' generalizations of the notions of vertex algebra and of…
We provide a decidable characterization of regular forest languages definable in FO2(<h,<v). By FO2(<h,<v) we refer to the two variable fragment of first order logic built from the descendant relation and the following sibling relation. In…