Search

The Rooted Maps Theory, a branch of the Theory of Homology, is shown to be a powerful tool for investigating the topological properties of Feynman diagrams, related to the single particle propagator in the quantum many-body systems. The numerical correspondence between the number of this class of Feynman diagrams as a function of perturbative order and the number of rooted maps as a function of the number of edges is studied. A graphical procedure to associate Feynman diagrams and rooted maps is then stated. Finally, starting from rooted maps principles, an original definition of the genus of a Feynman diagram, which totally differs from the usual one, is given., Comment: 20 pages, 30 figures, 3 tables

We address automated testing and interactive proving of properties involving complex data structures with constraints, like the ones studied in enumerative combinatorics, e.g., permutations and maps. In this paper we show testing techniques to check properties of custom data generators for these structures. We focus on random property-based testing and bounded exhaustive testing, to find counterexamples for false conjectures in the Coq proof assistant. For random testing we rely on the existing Coq plugin QuickChick and its toolbox to write random generators. For bounded exhaustive testing, we use logic programming to generate all the data up to a given size. We also propose an extension of QuickChick with bounded exhaustive testing based on generators developed inside Coq, but also on correct-by-construction generators developed with Why3. These tools are applied to an original Coq formalization of the combinatorial structures of permutations and rooted maps, together with some operations on them and properties about them. Recursive generators are defined for each combinatorial family. They are used for debugging properties which are finally proved in Coq. This large case study is also a contribution in enumerative combinatorics.

Bender–Canfield showed that a plethora of graph counting problems in orientable/non-orientable surfaces involve two constants tg and pg for the orientable and the non-orientable case, respectively. T.T.Q. Le and the authors recently discovered a hidden relation between the sequence tg and a formal power series solution u(z) of the Painlevé I equation which, among other things, allows to give exact asymptotic expansion of tg to all orders in 1/g for large g. The paper introduces a formal power series solution v(z) of a Riccati equation, gives a non-linear recursion for its coefficients and an exact asymptotic expansion to all orders in g for large g, using the theory of Borel transforms. In addition, we conjecture a precise relation between the sequence pg and v(z). Our conjecture is motivated by the enumerative aspects of a quartic matrix model for real symmetric matrices, and the analytic properties of its double scaling limit. In particular, the matrix model provides a computation of the number of rooted quadrangulations in the 2-dimensional projective plane. Our conjecture implies analyticity of the O(N)- and Sp(N)-types of free energy of an arbitrary closed 3-manifold in a neighborhood of zero. Finally, we give a matrix model calculation of the Stokes constants, pose several problems that can be answered by the Riemann–Hilbert approach, and provide ample numerical evidence for our results.

International audience; Several enumeration results are known about rooted maps on orientable surfaces, whereas rooted maps on non-orientable surfaces have seldom been studied. First, we unify both kind of maps, giving general functional equations for the generating series which counts rooted maps on any locally orientable surface, by number of vertices and faces. Then, we formally solve these equations, in order to establish a detailed common formula for all these generating series. All of them appear to be algebraic functions of the variables counting the number of vertices and faces. Explicit expressions and numerical tables for the series counting rooted maps on the non-orientable surfaces of genus 3 and 4 are given. (C) 2000 Elsevier Science B.V. All rights reserved.