Related papers: Arboreal tensor categories
Tensor models are generalizations of matrix models, and are studied as discrete models of quantum gravity for arbitrary dimensions. Among them, the canonical tensor model (CTM for short) is a rank-three tensor model formulated as a totally…
We extend the classification results for torsion classes and torsion-free classes in the category of finitely generated modules over a commutative noetherian ring to suitable symmetric monoidal closed noetherian abelian categories. Our main…
We introduce the notions of multiplier C*-category and continuous bundle of C*-categories, as the categorical analogues of the corresponding C*-algebraic notions. Every symmetric tensor C*-category with conjugates is a continuous bundle of…
Starting from an abelian category A such that every object has only finitely many subobjects we construct a semisimple tensor category T. We show that T interpolates the categories Rep(Aut(p),K) where p runs through certain projective…
To formalize calculations in linear algebra for the development of efficient algorithms and a framework suitable for functional programming languages and faster parallelized computations, we adopt an approach that treats elements of linear…
We study the category whose objects are trees (with or without roots) and whose morphisms are contractions. We show that the corresponding contravariant module categories are Noetherian, and we study two natural families of modules over…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
Category theory in homotopy type theory is intricate as categorical laws can only be stated "up to homotopy", and thus require coherences. The established notion of a univalent category (Ahrens, Kapulkin, Shulman) solves this by considering…
We introduce the notion of a diagram category and discuss its application to the invariant theory of classical groups and super groups, with some indications concerning extensions to quantum groups and quantum super groups. Tensor functors…
One of the major outstanding conjectures in the study of chromatic symmetric functions (CSF's) states that trees are uniquely determined by their CSF's. Though verified on graphs of order up to twenty-nine, this result has been proved only…
The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…
We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
We prove a constructive existence theorem for abelian envelopes of non-abelian monoidal categories. This establishes a new tool for the construction of tensor categories. As an example we obtain new proofs for the existence of several…
In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal order type of a class of generalized trees…
A new 2-parameter family of central structures in trees, called central forests, is introduced. Minieka's $m$-center problem and McMorris's and Reid's central-$k$-tree can be seen as special cases of central forests in trees. A central…
Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formula to count them and different combinatorial interpretations…
For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane…
We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…