相关论文: Children's Drawings and the Riemann-Hilbert Proble…

Graph theory and enumerative combinatorics are two branches of mathematical sciences that have developed astonishingly over the past one hundred years. It is especially important to point out that graph theory employs combinatorial…

We show that the spectral curve for Eynard-Orantin topological recursions satisfied by counting Grothendieck's dessins d'enfants are related to Narayana numbers. This suggests a connection of dessins to combinatorics of Coxeter groups,…

In this short note we introduce the Belyi degree of a number field K, which is the smallest degree of a dessin d'enfant having K as field of moduli. After the description of some general properties (for example, the fact that there exist…

We propose a solution to the problem of estimating a Riemannian metric associated with a given differentiable manifold. The metric learning problem is based on minimizing the relative volume of a given set of points. We derive the details…

This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…

We show that the Poincare polynomial associated with the orbifold cell decomposition of the moduli space of smooth algebraic curves with distinct marked points satisfies a topological recursion formula of the Eynard-Orantin type. The…

We describe the close connection between the linear system for the sixth Painlev\'e equation and the general Heun equation, formulate the Riemann-Hilbert problem for the Heun functions and show how, in the case of reducible monodromy, the…

Children learning their first language face multiple problems of induction: how to learn the meanings of words, and how to build meaningful phrases from those words according to syntactic rules. We consider how children might solve these…

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…

The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…

We state and prove a corrected version of a theorem of Singerman, which relates the existence of symmetries (anticonformal involutions) of a quasiplatonic Riemann surface $\mathcal S$ (one uniformised by a normal subgroup $N$ of finite…

We define solvable quantum mechanical systems on a Hilbert space spanned by bipartite ribbon graphs with a fixed number of edges. The Hilbert space is also an associative algebra, where the product is derived from permutation group…

We develop recursive formulas for the horizontal and vertical monodromies of a quasi-ordinary surface. These are monodromies associated to the Milnor fiber of a slice transverse to a component of the singular locus. In the course of working…

In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hypercubes) and maturity models (total orders) to yield models of…

We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…

Special Bohr - Sommerfeld geometry, first formulated for simply connected symplectic manifolds (or for simple connected algebraic varieties), gives rise to some natural problems for the simplest example in non simply connected case. Namely…

Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…

Combinatorial problems arising in puzzles, origami, and (meta)material design have rare sets of solutions, which define complex and sharply delineated boundaries in configuration space. These boundaries are difficult to capture with…

These lecture notes present a computation driven pathway from classical complex analysis to the theory of compact Riemann surfaces and their connections to algebraic geometry. The exposition follows a compute first then abstract philosophy,…