Related papers: Counting partitions of a fixed genus

We investigate the structure of the higher genus topological string amplitudes on the quintic hypersurface. It is shown that the partition functions of the higher genus than one can be expressed as polynomials of five generators. We also…

A group $G$ is said to be $k$-generated if it has a generating set with $k$ elements. A positive integer $n$ is called a \emph{2-generated number} if every group of order $n$ is 2-generated. In this article, we establish an arithmetic…

In the present work, we determine explicitly the genus of any separable cubic extension of any global function field given the minimal polynomial of the extension. We give algorithms computing the ramification data and the genus of any…

A linear chord diagram canonically determines a fatgraph and hence has an associated genus $g$. We compute the natural generating function ${\bf C}_g(z)=\sum_{n\geq 0} {\bf c}_g(n)z^n$ for the number ${\bf c}_g(n)$ of linear chord diagrams…

Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is…

Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…

Let $\alpha_k(\lambda)$ denote the number of $k$-hooks in a partition $\lambda$ and let $b(n,k)$ be the maximum value of $\alpha_k(\lambda)$ among partitions of $n$. Amdeberhan posed a conjecture on the generating function of $b(n,1)$. We…

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

We construct natural symbolic representations of intrinsically ergodic, but not necessarily expansive, principal algebraic actions of countably infinite amenable groups and use these representations to find explicit generating partitions…

Let V be an infinite matrix with rows and columns indexed by the positive integers, and entries in a field F. Suppose that v_{i,j} only depends on i-j and is 0 for |i-j| large. Then V^n is defined for all n, and one has a "generating…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

Let n_g denote the number of numerical semigroups of genus g. Bras-Amoros conjectured that n_g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree.…

Given $g\ge 1$, the number $n(g)$ of numerical semigroups $S \subset \N$ of genus $|\N \setminus S|$ equal to $g$ is the subject of challenging conjectures of Bras-Amor\'os. In this paper, we focus on the counting function $n(g,2)$ of…

The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. We find the behavior of coefficients in the partial fraction decomposition of this product as $N \to…

We provide an algorithm which decides whether a polynomial foliation $\mathcal{F}^{\mathbb{C}^2}$ on the complex plane has a polynomial first integral of genus $g\neq 1$. Except in a specific case, an extension of the algorithm also decides…

Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. Many algorithms exist to generate all descending compositions, yet none have previously been published to generate…