English
Related papers

Related papers: Exceptional sequences and rooted labeled forests

200 papers

We give an expression for the determinant of the twisted Laplacian associated with any linear representation of a finite quiver in terms of traces of the holonomy of its cycles. To establish this expression, we prove a general identity for…

Combinatorics · Mathematics 2026-03-24 Adrien Kassel , Thierry Lévy

The concept of scattered polynomials is generalized to those of exceptional scattered sequences which are shown to be the natural algebraic counterpart of $\mathbb{F}_{q^n}$-linear MRD codes. The first infinite family in the first…

Combinatorics · Mathematics 2022-11-22 Daniele Bartoli , Giuseppe Marino , Alessandro Neri , Lara Vicino

Let $(G,w)$ be an undirected weighted graph. The group inverse of $(G,w)$ is the weighted graph with the adjacency matrix $A^{\#}$, where $A$ is the adjacency matrix of $(G,w)$. We study the group inverse of singular weighted trees. It is…

Combinatorics · Mathematics 2023-04-07 Raju Nandi

The correspondence between the braid group on a solid torus of arbitrary genus and the algebra of Yang-Baxter and reflection equation operators is shown. A representation of this braid group in terms of $R$-matrices is given. The…

High Energy Physics - Theory · Physics 2008-02-03 C. Schwiebert

This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings…

Logic · Mathematics 2016-09-06 William Mitchell

We characterize unitary representations of braid groups $B_n$ of degree linear in $n$ and finite images of such representations of degree exponential in $n$.

Group Theory · Mathematics 2016-01-20 Michael J. Larsen , Eric C. Rowell

Three-graded root systems can be arranged into nested sequences. One exceptional sequence provides a natural means to recover some structures and symmetries familiar in the context of particle physics.

Combinatorics · Mathematics 2020-12-09 Benjamin Nasmith

Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable…

Populations and Evolution · Quantitative Biology 2024-10-22 Chloe E. Shiff , Noah A. Rosenberg

We extend Tilson's theory of the algebra of finite categories, in particular, the Derived Category Theorem, to the setting of forest algebras. As an illustration of the usefulness of this method, we provide a new proof of a result of Place…

Logic in Computer Science · Computer Science 2018-01-16 Howard Straubing

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

Probability · Mathematics 2025-11-24 Gabriel Berzunza Ojeda , Cecilia Holmgren , Paul Thévenin

We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…

Probability · Mathematics 2020-04-21 Xing Shi Cai , Cecilia Holmgren , Svante Janson , Tony Johansson , Fiona Skerman

In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…

Combinatorics · Mathematics 2008-09-16 Patricia Hersh

We give a short proof of Cayley's tree formula for counting the number of different labeled trees on $n$ vertices. The following nonlinear recursive relation for the number of labeled trees on $n$ vertices is deduced from a combinatorial…

Combinatorics · Mathematics 2022-12-22 Alok Bhushan Shukla

Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…

Combinatorics · Mathematics 2023-05-02 Svetlana Poznanović , Maria Rodriguez Hertz , Solomon Valore-Caplan , David Wichmann

In his seminal paper on complex reflection arrangements, Bessis introduces a Garside structure for the braid group of a well-generated irreducible complex reflection group. Using this Garside structure, he establishes a strong connection…

Group Theory · Mathematics 2023-01-23 Owen Garnier

We develop a theoretical framework for the analysis of oblique decision trees, where the splits at each decision node occur at linear combinations of the covariates (as opposed to conventional tree constructions that force axis-aligned…

Statistics Theory · Mathematics 2023-09-01 Matias D. Cattaneo , Rajita Chandak , Jason M. Klusowski

For any graded commutative noetherian ring, where the grading group is abelian and where commutativity is allowed to hold in a quite general sense, we establish an inclusion-preserving bijection between, on the one hand, the twist-closed…

Category Theory · Mathematics 2012-11-07 Ivo Dell'Ambrogio , Greg Stevenson

This work presents an approach towards the representation theory of the braid groups $B_n$. We focus on finite-dimensional representations over the field of Laurent series which can be obtained from representations of infinitesimal braids,…

Representation Theory · Mathematics 2007-05-23 Ivan Marin

We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Mélou

We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n)…

Group Theory · Mathematics 2007-05-23 Daan Krammer