Related papers: Tree Orbits under Permutation Group Action: Algori…
We define new combinatorial objects, called shrubs, such that forests of rooted trees are shrubs. We then introduce a structure of operad on shrubs. We show that this operad is contained in the Zinbiel operad, by using the inclusion of…
We investigate the tree gonality of a genus-$g$ metric graph, defined as the minimum degree of a tropical morphism from any tropical modification of the metric graph to a metric tree. We give a combinatorial constructive proof that this…
We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…
In order to replicate within their cellular host, many viruses have developed self-assembly strategies for their capsids which are sufficiently robust as to be reconstituted in vitro. Mathematical models for virus self-assembly usually…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
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…
We simulate the assembly dynamics of icosahedral capsids from subunits that interconvert between different conformations (or quasi-equivalent states). The simulations identify mechanisms by which subunits form empty capsids with only one…
We consider groups $\mathbb{I}$ of isometries of ultrametric Urysohn spaces $\mathbb{U}$. Such spaces $\mathbb{U}$ admit transparent realizations as boundaries of certain $R$-trees and the groups $\mathbb{I}$ are groups of automorphisms of…
The classical Gaussian functor associates to every orthogonal representation of a locally compact group $G$ a probability measure preserving action of $G$ called a Gaussian action. In this paper, we generalize this construction by…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
A rotated odometer is an infinite interval exchange transformation (IET) obtained as a composition of the von Neumann-Kakutani map and a finite IET of intervals of equal length. In this paper, we consider rotated odometers for which the…
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…
We introduce a new construction, the isotropy groupoid, to organize the orbit data for split $\Gamma$-spaces. We show that equivariant principal $G$-bundles over split $\Gamma$-CW complexes $X$ can be effectively classified by means of…
This paper provides a preparatory introduction to torsors, written with a view toward later applications in the author's work. Rather than aiming at a comprehensive survey, the exposition focuses on those aspects of torsors that are most…
The Neighbor-Joining algorithm is a popular distance-based phylogenetic method that computes a tree metric from a dissimilarity map arising from biological data. Realizing dissimilarity maps as points in Euclidean space, the algorithm…
Let G be a finite group. To every smooth G-action on a compact, connected and oriented surface we can associate its data of singular orbits. The set of such data becomes an Abelian group B_G under the G-equivariant connected sum. We will…
String and particle braiding statistics are examined in a class of topological orders described by discrete gauge theories with a gauge group $G$ and a 4-cocycle twist $\omega_4$ of $G$'s cohomology group…
We study non-nesting actions on R-trees. We prove that some natural conditions describing how the group is generated, imply that such an action involves an isometric action on an R-tree. This can be applied to permutation groups, linear…
In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…
Icosahedral virus capsids are composed of symmetrons, organized arrangements of capsomers. There are three types of symmetrons: disymmetrons, trisymmetrons, and pentasymmetrons, which have different shapes and are centered on the…