Related papers: Tree Orbits under Permutation Group Action: Algori…

In this paper, we consider covering graphs obtained by lifting a tree with a loop at each vertex as a voltage graph over a cyclic group. We generalize a tool of Hell, Nishiyama, and Stacho, known as the billiard strategy, for constructing…

Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…

It is shown that for any action of a finitely presented group $G$ on an $\R$-tree, there is a decomposition of $G$ as the fundamental group of a graph of groups related to this action. If the action of $G$ on $T$ is non-trivial, i.e. there…

We show that the Baum--Connes assembly map factors canonically through the unitary conjugation groupoid, which serves as a universal mediator among groupoid models that are Morita equivalent to a given transformation groupoid. This…

We introduce the contour process to describe the geometrical properties of merger trees. The contour process produces a one-dimensional object, the contour walk, which is a translation of the merger tree. We portray the contour walk through…

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Many integer sequences arise as numbers of $G$-orbits on $\binom{X}{n}$ as $n$ varies, for a permutation group $G\subseteq \operatorname{Sym}(X)$. For finite $X$, Stanley proved that these finite sequences increase towards the middle using…

Given a countably infinite group $G$ acting on some space $X$, an increasing family of finite subsets $G_n$ and $x\in X$, a natural question to ask is what asymptotical distribution the sets $G_nx$ form. More formally, we define for a…

Let G be a ribbon graph, i.e., a connected finite graph G together with a cyclic ordering of the edges around each vertex. By adapting a construction due to O. Bernardi, we associate to any pair (v,e) consisting of a vertex v and an edge e…

In the self-assembly process which drives the formation of cellular membranes, micelles, and capsids, a collection of separated subunits spontaneously binds together to form functional and more ordered structures. In this work, we study the…

Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…

Braman [B08] described a construction where third-order tensors are exactly the set of linear transformations acting on the set of matrices with vectors as scalars. This extends the familiar notion that matrices form the set of all linear…

We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…

Motivated by applications to low-rank matrix completion, we give a combinatorial characterization of the independent sets in the algebraic matroid associated to the collection of $m\times n$ rank-2 matrices and $n\times n$ skew-symmetric…

The action of a finite reflection group (type A) on its set of roots is understood as a permutation representation or group action. We show that this representation is an induced representation from a certain kind of parabolic subgroup.…

Let $V$ be a simple vertex algebra of countable dimension, $G$ be a finite automorphism group of $V$ and $\sigma$ be a central element of $G$. Assume that ${\cal S}$ is a finite set of inequivalent irreducible $\sigma$-twisted $V$-modules…

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…

Merger trees harvested from cosmological $N$-body simulations encode the assembly histories of dark matter halos over cosmic time, and are a fundamental component of semi-analytical models (SAMs) of galaxy formation. The ability to compare…

This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…