Related papers: Exceptional sequences and rooted labeled forests

In phylogenetics, evolution is traditionally represented in a tree-like manner. However, phylogenetic networks can be more appropriate for representing evolutionary events such as hybridization, horizontal gene transfer, and others. In…

A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…

We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional sequences for any finite dimensional algebra. We prove that for a fixed algebra of rank $n$, and for any positive integer $t \leq n$, there is a bijection between…

If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We…

We construct the reduction of an exact category with a twist functor with respect to an element of its graded center in presence of an exact-conservative forgetful functor annihilating this central element. The procedure allows, e.g., to…

Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems. In contrast to ``classic'' decision trees with constant values in their leaves, model trees can use linear…

Let $G$ be an infinite graph such that each tree in the wired uniform spanning forest on $G$ has one end almost surely. On such graphs $G$, we give a family of continuous, measure preserving, almost one-to-one mappings from the wired…

Using the notion of compatibility between Poisson brackets and cluster structures in the coordinate rings of simple Lie groups, Gekhtman Shapiro and Vainshtein conjectured a correspondence between the two. Poisson Lie groups are classified…

We prove that the set of non-degenerate second order maximally superintegrable systems in the complex Euclidean plane carries a natural structure of a projective variety, equipped with a linear isometry group action. This is done by…

We construct a weak representation of the category of framed affine tangles on a disjoint union of triangulated categories ${\mathcal D}_{2n}$. The categories we use are that of coherent sheaves on Springer fibers over a nilpotent element…

We investigate invariant random subgroups in groups acting on rooted trees. Let $\mathrm{Alt}_f(T)$ be the group of finitary even automorphisms of the $d$-ary rooted tree $T$. We prove that a nontrivial ergodic IRS of $\mathrm{Alt}_f(T)$…

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…

Let X be an algebraic variety with an action of an algebraic group G. Suppose X has a full exceptional collection of sheaves, and these sheaves are invariant under the action of the group. We construct a semiorthogonal decomposition of…

The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…

In 1989 Erd\H{o}s and Sz\'ekely showed that there is a bijection between (i) the set of rooted trees with $n+1$ vertices whose leaves are bijectively labeled with the elements of $[\ell]=\{1,2,\dots,\ell\}$ for some $\ell \leq n$, and (ii)…

Here a loop braid representation is a monoidal functor $\mathsf{F}$ from the loop braid category $\mathsf{L}$ to a suitable target category, and is $N$-charge-conserving if that target is the category $\mathsf{Match}^N$ of charge-conserving…

In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes…

Let $a$ be a real euclidean vector space of finite dimension and $\Sigma$ a root system in $a$ with a basis $\Delta$. Let $\Theta \subset \Delta$ and $M = M_{\Theta}$ be a standard Levi of a reductive group $G$ such that $a_{\Theta}$ $= a_M…