Related papers: On discrete surfaces: Enumerative geometry, matrix…
We study the correlators $W_{g,n}$ arising from Orlov-Scherbin 2-Toda tau functions with rational content-weight $G(z)$, at arbitrary values of the two sets of time parameters. Combinatorially, they correspond to generating functions of…
Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…
In the O(n) loop model on random planar maps, we study the depth - in terms of the number of levels of nesting - of the loop configuration, by means of analytic combinatorics. We focus on the 'refined' generating series of pointed disks or…
We define a new large $N$ limit for general $\text{O}(N)^{R}$ or $\text{U}(N)^{R}$ invariant tensor models, based on an enhanced large $N$ scaling of the coupling constants. The resulting large $N$ expansion is organized in terms of a…
We study the geometric and dynamical structure induced by the return map associated with domains in the class \(\mathcal{O}_{C}\). This map, defined through a geometric round-trip between the convex core and the outer boundary, generates a…
The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space.…
On a geometrical view, the conception of map geometries are introduced, which is a nice model of the Smarandache geometries, also new kind of and more general intrinsic geometry of surface. Results convinced one that map geometries are…
{\it Fold maps} are fundamental tools in generalizing the theory of Morse functions and its application to studies of geometric properties of manifolds. One of the fundamental and important problems in the theory of fold maps is to…
The method of alternating projections (MAP) is a common method for solving feasibility problems. While employed traditionally to subspaces or to convex sets, little was known about the behavior of the MAP in the nonconvex case until 2009,…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
This paper shows that the topological structures of particle orbits generated by a generic class of vector fields on spherical surfaces, called {\it the flow of finite type}, are in one-to-one correspondence with discrete structures such as…
The $s$-point correlation function of a Gaussian Hermitian random matrix theory, with an external source tuned to generate a multi-critical singularity, provides the intersection numbers of the moduli space for the $p$-th spin curves…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
We develop a renormalization theory of non-perturbative dissipative H\'enon-like maps with combinatorics of bounded type. The main novelty of our approach is the incorporation of Pesin theoretic ideas to the renormalization method, which…
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…
The class of special generic maps contains Morse functions with exactly two singular points, characterizing spheres topologically which are not $4$-dimensional and the $4$-dimensional unit sphere. This class is for higher dimensional…
We study a connection between random tensors and random matrices through $U(\tau)$ matrix models which generate fully packed, oriented loops on random surfaces. The latter are found to be in bijection with a set of regular edge-colored…
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…
This paper is based on the author's talk at the 2012 Workshop on Geometric Methods in Physics held in Bialowieza, Poland. The aim of the talk is to introduce the audience to the Eynard-Orantin topological recursion. The formalism is…