Related papers: Simple recurrence formulas to count maps on orient…

We give a 'recursive' formula (in terms of reducible limits) for counting rational curves on a variety moving in any sufficiently large and well-behaved family. Our approach is completely elementary and makes no use of moduli spaces for…

The second part of the paper is devoted to enumeration of $r$-regular toroidal maps up to all homeomorphisms of the torus (unsensed maps). We describe in detail the periodic orientation reversing homeomorphisms of the torus which turn out…

I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n…

In this paper the number of ways to glue together several polygons into a surface of genus $g$ has been investigated. We've given an elementary proof on the formula for the generating function $\mathbf{C}_g^{[2]}(z)$ of the number of…

This paper provides an alternate proof to parts of the Goulden-Slofstra formula for enumerating two vertex maps by genus, which is an extension of the famous Harer-Zagier formula that computes the Euler characteristic of the moduli space of…

Let $S_g$ denote the closed orientable surface of genus $g$. We construct exponentially many mapping class group orbits of collections of $2g+1$ simple closed curves on $S_g$ which pairwise intersect exactly once, extending a result of the…

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…

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…

Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…

Using equivariant geometry, we find a universal formula that computes the number of times a general cubic surface arises in a family. As applications, we show that the PGL(4) orbit closure of a generic cubic surface has degree 96120, and…

We consider Cannon cone types for a surface group of genus $g$, and we give algebraic criteria for establishing the cone type of a given cone and of all its sub-cones. We also re-prove that the number of cone types is exactly $8g(2g -…

We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.

We count points on character varieties associated with punctured surfaces and regular semisimple generic conjugacy classes in reductive groups. We find that the number of points are palindromic polynomials. This suggests a $P=W$ conjecture…

The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains on surfaces. In this paper the conjugate function method, earlier used for simply connected domains, is…

This paper concerns the discrete version of the Painlev\'e identification problem, i.e., how to recognize a certain recurrence relation as a discrete Painlev\'e equation. Often some clues can be seen from the setting of the problem, e.g.,…

Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…

The aim of the paper is to clarify the nature of combinatorial structures associated with maps on closed compact surfaces. We prove that maps give rise to Lagrangian matroids representable in a setting provided by cohomology of the surface…

Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.

Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a $(r+2)$-term recurrence relation connecting the type II multiple orthogonal polynomials near the diagonal (the so-called step-line recurrence…