Related papers: P\'olya theory for species with an equivariant gro…
Pondering upon the grammatical labeling of 0-1-2 increasing plane trees, we come to the realization that the grammatical labels play a role as records of chopped off leaves of the original increasing binary trees. While such an…
The theory of {\Gamma}-species is developed to allow species-theoretic study of quotient structures in a categorically rigorous fashion. This new approach is then applied to two graph-enumeration problems which were previously unsolved in…
We develop a calculus for $S_n$-equivariant Euler characteristics of moduli spaces of stable curves and stable maps. Our approach involves an enrichment of P\'olya's cycle index polynomial of a graph to a certain algebra $\Lambda^{[2]}$ of…
We use our extension of the symbolic method in enumerative combinatorics (we extend finite sums defining coefficients in generating functions to infinite series) to generalize P\'olya's theorem. This theorem determines limits of…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
We adapt the classical framework of algebraic theories to work in the setting of (infinity,1)-categories developed by Joyal and Lurie. This gives a suitable approach for describing highly structured objects from homotopy theory. A central…
As a fundamental and ubiquitous combinatorial notion, species has attracted sustained interest, generalizing from set-theoretical combinatorial to algebraic combinatorial and beyond. The Rota-Baxter algebra is one of the algebraic…
A cluster algebra is an algebraic structure generated by operations of a quiver (a directed graph) called the mutations and their associated simple birational mappings. By using a graph-combinatorial approach, we present a systematic way to…
We apply the version of P\'{o}lya-Redfield theory obtained by White to count patterns with a given automorphism group to the enumeration of strong dichotomy patterns, that is, we count bicolor patterns of $\mathbb{Z}_{2k}$ with respect to…
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
In this article, we develop a new class of multivariate distributions adapted for count data, called Tree P\'olya Splitting. This class results from the combination of a univariate distribution and singular multivariate distributions along…
The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…
In this article we give a classification of the sub-groups in PSL(2,Z) and of the conjugacy classes of these sub-groups by the mean of an combinatorial invariant: some trivalent diagrams (dotted or not). We give explicit formulae enabling…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
P\'olya trees are rooted, unlabeled trees on $n$ vertices. This paper gives an efficient, new way to generate P\'olya trees. This allows comparing typical unlabeled and labeled tree statistics and comparing asymptotic theorems with…
Dynamic linear models with Gaussian observations and Gaussian states lead to closed-form formulas for posterior simulation. However, these closed-form formulas break down when the response or state evolution ceases to be Gaussian. Dynamic,…
This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the…