Related papers: A Matrix Model for Higher-Genus Fuss--Catalan Numb…

We construct (q,t)-Catalan polynomials and q-Fuss-Catalan polynomials for any irreducible complex reflection group W. The two main ingredients in this construction are Rouquier's formulation of shift functors for the rational Cherednik…

Higher genus modular invariance of two-dimensional conformal field theories (CFTs) is a largely unexplored area. In this paper, we derive explicit expressions for the higher genus partition functions of a specific class of CFTs: code CFTs,…

We contruct a one-to-one correspondence between a subset of numerical semigroups with genus $g$ and $\gamma$ even gaps and the integer points of a rational polytope. In particular, we give an overview to apply this correspondence to try to…

Let X be an Abelian surface and C a holomorphic curve in X representing a primitive homology class. The space of genus g curves in the class of C is g dimensional. We count the number of such curves that pass through g generic points and we…

A fine-grained comparison of generative models requires the identification of sample types generated differently by each of the involved models. While quantitative scores have been proposed in the literature to rank different generative…

In this note, we show how to define certain Riordan arrays, that we call the Fuss-Catalan-Riordan arrays, by means of a special family of $d$-orthogonal polynomials. We relate the Fuss-Catalan Riordan arrays to the Fuss Catalan numbers, and…

We consider the Dubrovin--Frobenius manifold of rank $2$ whose genus expansion at a special point controls the enumeration of a higher genera generalization of the Catalan numbers, or, equivalently, the enumeration of maps on surfaces,…

We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fu\ss-Catalan numbers, and to subgroup counting functions…

The paper discusses the edge hyper-Zagreb index of a graph, which is calculated by replacing vertex degrees with edge degrees. The degree of an edge is determined by adding up the degrees of the end vertices of the edge and subtracting 2.…

We propose principled Gaussian processes (GPs) for modeling functions defined over the edge set of a simplicial 2-complex, a structure similar to a graph in which edges may form triangular faces. This approach is intended for learning…

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…

For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…

We study the enumeration of mixed dimer covers on skew Young diagrams of ribbon shape (also called border strips or snake graphs). For the two extreme cases of straight and zigzag shapes, we show that the number of mixed dimer covers are…

The problem of counting unicellular hypermonopoles by the number of their hyperedges is equivalent to describing the cycle length distribution of a product of two circular permutations, first solved by Zagier. The solution of this problem…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

We study the Fuss--Catalan algebras, which are generalizations of the Temperley--Lieb algebra and act on generalized Dyck paths, through non-crossing partitions. First, the Temperley--Lieb algebra is defined on non-crossing partitions, and…

We consider a subclass of the class of group-theoretical fusion categories: To every finite group $G$ and subgroup $H$ one can associate the category of $G$-graded vector spaces with a two-sided $H$-action compatible with the grading. We…

The basic (and traditional) crossing number problem is to determine the minimum number of crossings in a topological drawing of an input graph in the plane. We develop a unified framework yielding fixed-parameter tractable (FPT) algorithms…