Related papers: Arboreal tensor categories

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

A ternary complex tree related to the golden ratio is used to show how the theory of complex trees works. We use the topological set of this tree to obtain a parametric family of trees in one complex variable. Even though some real ferns…

This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…

The paper presents an algorithm for topological classification of nondegenerate saddle-focus singularities of integrable Hamiltonian systems with three degrees of freedom up to semi-local equivalence. In particular, we prove that any…

In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We review the construction of braided tensor categories and modular tensor categories from representations of vertex operator algebras, which correspond to chiral algebras in physics. The extensive and general theory underlying this…

For a large class of geometric objects, the passage to categories of quasi-coherent sheaves provides an embedding in the 2-category of abelian tensor categories. The notion of weakly Tannakian categories introduced by the author gives a…

We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…

Many key invariants in the representation theory of classical groups (symmetric groups $S_n$, matrix groups $GL_n$, $O_n$, $Sp_{2n}$) are polynomials in $n$ (e.g., dimensions of irreducible representations). This allowed Deligne to extend…

We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…

We start the general structure theory of not necessarily semisimple finite tensor categories, generalizing the results in the semisimple case (i.e. for fusion categories), obtained recently in our joint work with D.Nikshych. In particular,…

We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…

We introduce the notion of meromorphic tensor category and illustrate it in several examples. They include representations of quantum affine algebras, chiral algebras of Beilinson and Drinfeld, G-vertex algebras of Borcherds, and…

The arithmetic of the natural numbers can be extended to arithmetic operations on planar binary trees. This gives rise to a non-commutative arithmetic theory. In this exposition, we describe this arithmetree, first defined by Loday, and…

For a labelled tree on the vertex set $[n]:=\{1,2,..., n\}$, define the direction of each edge $ij$ to be $i\to j$ if $i<j$. The indegree sequence of $T$ can be considered as a partition $\lambda \vdash n-1$. The enumeration of trees with a…

The main purpose of this paper is to introduce a new category, which we call a resonance category, whose combinatorics reflect that of canonical stratifications of $n$-fold symmetric smash products. The study of the stratifications can then…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

Building on early work by Stevo Todorcevic, we describe a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize…

We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…