Related papers: P\'olya theory for species with an equivariant gro…
In 1981, Andr\'e Joyal provided a combinatorial interpretation of the algebra of formal power series, a central gadget in the toolkit of enumerative combinatorics. In Joyal's theory of species of structures, combinatorial species (like…
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…
We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '$\Gamma$-species' which incorporates data about 'structural' group actions). This culminates…
In combinatorics, P\'{o}lya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds. In this paper, we present an extension of P\'{o}lya's…
The combinatorial theory of species developed by Joyal provides a foundation for enumerative combinatorics of objects constructed from finite sets. In this paper we develop an analogous theory for the enumerative combinatorics of objects…
We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an "unbiased" way that a structure of size n gives rise to n…
P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…
An introduction to Joyal's theory of combinatorial species is given and through it an alternative view of Rota's twelvefold way emerges.
Interest in combinatorial interpretations of mathematical entities stems from the convenience of the concrete models they provide. Finding a bijective proof of a seemingly obscure identity can reveal unsuspected significance to it. Finding…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
Although the P\'olya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of…
A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…
Though Joyal's species are known to categorify generating functions in enumerative combinatorics, they also categorify zeta functions in algebraic geometry. The reason is that any scheme $X$ of finite type over the integers gives a "zeta…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
Replacing the usual notion of quotient sets by the notion of orbiquotient sets we obtain a generalization of P\'olya theory. The key ingredient of our extended theory is the definition of the orbicycle index polynomial which we compute in…
We introduce an extension of the P\'olya tree approach for constructing distributions on the space of probability measures. By using optional stopping and optional choice of splitting variables, the construction gives rise to random…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
We study generalized automata (in the sense of Ad\'amek-Trnkov\'a) in Joyal's category of (set-valued) combinatorial species, and as an important preliminary step, we study coalgebras for its derivative endofunctor $\partial$ and for the…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
In earlier work we proposed a generating function that encodes the Jordan block spectrum of the integrable Hypereclectic spin chain, related to the one-loop dilatation operator of the dynamical fishnet quantum field theory. We significantly…