Related papers: Enumeration of non-oriented maps via integrability
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
Maps are polygonal cellular networks on Riemann surfaces. This paper analyzes the construction of closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. The method of…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the…
The enumeration of maps and the study of uniform random maps have been classical topics of combinatorics and statistical physics ever since the seminal work of Tutte in the sixties. Following the bijective approach initiated by Cori and…
We provide necessary and sufficient conditions for the Hessenberg recurrence matrix associated with a system of multiple orthogonal polynomials to admit a factorisation as a product of bidiagonal matrices. Using the Gauss-Borel…
A nonlinear generalisation of the PageRank problem involving the Moore-Penrose inverse of an incidence matrix is developed for local graph partitioning purposes. The Levenberg-Marquardt method with a full rank Jacobian variant provides a…
In this paper we introduce and discuss some classes of orthogonal polynomials in several non-commuting variables. The emphasis is on a non-commutative version of the orthogonal polynomials on the real line. We introduce recurrence equations…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
We introduce a series of discrete mappings, which is considered to be an extension of the Hietarinta-Viallet mapping with one parameter. We obtain the algebraic entropy for this mapping by obtaining the recurrence relation for the degrees…
We prove that the topological recursion reconstructs the WKB expansion of a quantum curve for all spectral curves whose Newton polygons have no interior point (and that are smooth as affine curves). This includes nearly all previously known…
We consider maps on genus-$g$ surfaces with $n$ (labeled) faces of prescribed even degrees. It is known since work of Norbury that, if one disallows vertices of degree one, the enumeration of such maps is related to the counting of lattice…
This paper deals with the estimation of the modes of an univariate mixture when the number of components is known and when the component density are well separated. We propose an algorithm based on the minimization of the "kp" criterion we…
This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections,…
Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…
Following Zhou's framework, we consider the emergent geometry of the generalized Br\'ezin-Gross-Witten models whose partition functions are known to be a family of tau-functions of the BKP hierarchy. More precisely, we construct a spectral…
We develop a numerical method for computing with orthogonal polynomials that are orthogonal on multiple, disjoint intervals for which analytical formulae are currently unknown. Our approach exploits the Fokas--Its--Kitaev Riemann--Hilbert…
We introduce a useful and rather simple classes of BKP tau functions which which we shall shall call "easy tau functions". We consider the "large BKP hiearchy" related to $O(2\infty +1)$ which was introduced in \cite{KvdLbispec} (which is…