Related papers: Exceptional sequences and rooted labeled forests

Let $C$ be a hyperelliptic curve $y^2 = f(x)$ over a discretely valued field $K$. The $p$-adic distances between the roots of $f(x)$ can be described by a completely combinatorial object known as the cluster picture. We show that the…

The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…

We establish three independent results on groups acting on trees. The first implies that a compactly generated locally compact group which acts continuously on a locally finite tree with nilpotent local action and no global fixed point is…

An increasing 1,2-tree is a labeled graph formed by starting with a vertex and then repeatedly attaching a leaf to a vertex or a triangle to an edge, the labeling of the vertices corresponding to the order in which the vertices are added.…

Random Forests and related tree-based methods are popular for supervised learning from table based data. Apart from their ease of parallelization, their classification performance is also superior. However, this performance, especially…

We say that an unordered rooted labeled forest avoids the pattern $\pi\in\mathcal{S}_n$ if the sequence obtained from the labels along the path from the root to any vertex does not contain a subsequence that is in the same relative order as…

A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

The space of unordered configurations of distinct points in the plane is aspherical, with Artin's braid group as its fundamental group. Remarkably enough, the space of ordered configurations of distinct points on the real projective line,…

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

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…

In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…

Tree ensemble models like random forests and gradient boosting machines are widely used in machine learning due to their excellent predictive performance. However, a high-performance ensemble consisting of a large number of decision trees…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

We develop a new approach to the linear ordering of the braid group $B\_n$, based on investigating its restriction to the set $\Div(\Delta\_n^d)$ of all divisors of $\Delta\_n^d$ in the monoid $B\_\infty^+$, i.e., to positive $n$-braids…

We study group actions on multitrees, which are directed graphs in which there is at most one directed path between any two vertices. In our main result we describe a six-term exact sequence in $K$-theory for the reduced crossed product…

We construct a category $\OrdFor$ as an arboreal extension of $\Delta_{\mathrm{epi}}\subseteq\Delta$, whose morphisms are ordered forests composed by grafting. We define a full functor $\pi\colon \OrdFor\to\Delta_{\mathrm{epi}}^{op}$…

In this article, we study the irreducibility of representations of the singular braid group on $n$ strands, namely $SB_n$. Our first finding is the determination of the forms of all irreducible representations $\rho : SB_2 \to…

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…

In this paper we first study clusters in type $\tilde{\mathbb{A}}$ by collecting them into a finite number of infinite families given by Dehn twists of their corresponding triangulations, and show that these families are counted by the…