Related papers: Arboreal tensor categories
We introduce, for a symmetric fusion category $\mathcal{A}$ with Drinfeld centre $\mathcal{Z}(\mathcal{A})$, the notion of $\mathcal{Z}(\mathcal{A})$-crossed braided tensor category. These are categories that are enriched over…
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…
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…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…
We introduce new objects, the interval-posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear form that appears in the functional equation of Tamari intervals described by Chapoton.…
We show that there is a braided tensor category structure on the category of $C_1$-cofinite modules for the (universal or simple) Virasoro vertex operator algebras of arbitrary central charge. In the generic case of central charge…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…
Knop constructed a tensor category associated to a finitely-powered regular category equipped with a degree function. In recent work with Harman, we constructed a tensor category associated to an oligomorphic group equipped with a measure.…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…
A premonoidal category is equipped only with a bifunctor and a natural isomorphism for associativity. We introduce a (deformation) natural automorphism representing the deviation from the Pentagon condition. We uncover a binary tree…
Tensor hierarchy algebras constitute a class of non-contragredient Lie superalgebras, whose finite-dimensional members are the "Cartan-type" Lie superalgebras in Kac's classification. They have applications in mathematical physics,…
Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is…
Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…
We define a notion on preadditive categories which plays a role similar to the notion of a Grothendieck pretopology on an unenriched category. Each such additive pretopology defines an additive Grothendieck topology and suffices to define…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…