Related papers: Arboreal tensor categories
The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…
A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…
This paper shows that decision trees constructed with Classification and Regression Trees (CART) and C4.5 methodology are consistent for regression and classification tasks, even when the number of predictor variables grows…
In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…
We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…
Given $n \geq 1$, we study the existence of a tree on $n$ vertices whose independence polynomial is symmetric and unimodal as well as the existence of a symmetric and unimodal independence polynomial of degree $n$ of a tree.
The paper introduces two new aggregation functions to encode structural knowledge from tree-structured data. They leverage the Canonical and Tensor-Train decompositions to yield expressive context aggregation while limiting the number of…
We establish sufficient conditions for the C$^*$-simplicity of two classes of groups. The first class is that of groups acting on trees, such as amalgamated free products, HNN-extensions, and their normal subgroups; for example normal…
A graded tensor category over a group $G$ will be called a strongly $G$-graded tensor category if every homogeneous component has at least one multiplicativily invertible object. Our main result is a description of the module categories…
We study simple extensions of pointed finite tensor categories, that is, tensor categories $\mathcal{C}$ admitting an abelian decomposition $\mathcal{C} \cong \mathcal{D} \oplus \mathcal{M}$ where $\mathcal{D}$ is a pointed tensor…
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
Given an essentially small triangulated category it is possible to give a metric on it, to complete it with respect to the metric, and to look at the subcategory of objects in the completion which are compactly supported with respect to the…
We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '$\Gamma$-species' which incorporates data about 'structural' group actions). This culminates…
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.
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
Let $G$ be the group of all order-preserving self-maps of the real line. In previous work, the first two authors constructed a pre-Tannakian category $\underline{\mathrm{Rep}}(G)$ associated to $G$. The present paper is a detailed study of…
We consider combinatorial aspects of $\lambda$-terms in the model based on de Bruijn indices where each building constructor is of size one. Surprisingly, the counting sequence for $\lambda$-terms corresponds also to two families of binary…
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
The nontrivial unital composition superalgebras, of dimension 3 and 6, which exist only in characteristic 3, are obtained from the split Cayley algebra and its order 3 automorphisms, by means of the process of semisimplification of the…