Related papers: Simple formulas for constellations and bipartite m…
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
We calculate the Laplace transform of the cut-and-join equation of Goulden, Jackson and Vakil. The result is a polynomial equation that has the topological structure identical to the Mirzakhani recursion formula for the Weil-Petersson…
Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…
We compute the number of (weak) equivalence classes of branched covers from a surface of genus g to the sphere, with 3 branching points, degree 2k, and local degrees over the branching points of the form (2,...,2), (2h+1,1,2,...,2),…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
We answer some enumerative questions about irreducible rational curves on Hirzebruch surfaces, by combining an idea of Kontsevich with the study of the geometry of certain natural parameter spaces. Our formulas generalize Kontsevich's…
We study the local limits of uniform high genus bipartite maps with prescribed face degrees. We prove the convergence towards a family of infinite maps of the plane, the q-IBPMs, which exhibit both a spatial Markov property and a hyperbolic…
A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…
We consider the problem of enumerating planar constellations with two points at a prescribed distance. Our approach relies on a combinatorial correspondence between this family of constellations and the simpler family of rooted…
We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a…
We obtain explicit branching rules for graded cell modules and graded simple modules over the endomorphism algebra of a Bott-Samelson bimodule. These rules allow us to categorify a well-known recursive formula for Kazhdan-Lusztig…
This article introduces mixed double Hurwitz numbers, which interpolate combinatorially between the classical double Hurwitz numbers studied by Okounkov and the monotone double Hurwitz numbers introduced recently by Goulden, Guay-Paquet and…
This article is an extended version of preprint math.AG/9902104. We find an explicit formula for the number of topologically different ramified coverings of a sphere by a genus g surface with only one complicated branching point in terms of…
Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…
Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…
In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…