Results 1 - 10
of
91
Intersection theory, integrable hierarchies and topological field theory,” hep-th/9201003
"... In these lecture notes we review the various relations between intersection theory on the moduli space of Riemann surfaces, integrable hierarchies of KdV type, matrix models, and topological field theory. We focus in particular on the question why matrix integrals of the type considered by Kontsevic ..."
Abstract
-
Cited by 91 (5 self)
- Add to MetaCart
In these lecture notes we review the various relations between intersection theory on the moduli space of Riemann surfaces, integrable hierarchies of KdV type, matrix models, and topological field theory. We focus in particular on the question why matrix integrals of the type considered by Kontsevich naturally appear as τ-functions of integrable hierarchies related to topological minimal models.
Modular Operads
- COMPOSITIO MATH
, 1994
"... We develop a "higher genus" analogue of operads, which we call modular operads, in which graphs replace trees in the definition. We study a functor F on the category of modular operads, the Feynman transform, which generalizes Kontsevich's graph complexes and also the bar construction for operads. ..."
Abstract
-
Cited by 64 (5 self)
- Add to MetaCart
We develop a "higher genus" analogue of operads, which we call modular operads, in which graphs replace trees in the definition. We study a functor F on the category of modular operads, the Feynman transform, which generalizes Kontsevich's graph complexes and also the bar construction for operads. We calculate the Euler characteristic of the Feynman transform, using the theory of symmetric functions: our formula is modelled on Wick's theorem. We give applications to the theory of moduli spaces of pointed algebraic curves.
Random matrices and random permutations
- Internat. Math. Res. Notices
, 2000
"... We prove the conjecture of Baik, Deift, and Johansson which says that with respect to the Plancherel measure on the set of partitions λ of n, the rows λ1,λ2,λ3,... of λ behave, suitably scaled, like the 1st, 2nd, 3rd, and so on eigenvalues of a Gaussian random Hermitian matrix as n → ∞. Our proof is ..."
Abstract
-
Cited by 55 (7 self)
- Add to MetaCart
We prove the conjecture of Baik, Deift, and Johansson which says that with respect to the Plancherel measure on the set of partitions λ of n, the rows λ1,λ2,λ3,... of λ behave, suitably scaled, like the 1st, 2nd, 3rd, and so on eigenvalues of a Gaussian random Hermitian matrix as n → ∞. Our proof is based on an interplay between maps on surfaces and ramified coverings of the sphere. We also establish a connection of this problem with intersection theory on the moduli spaces of curves. 1
Ribbon graphs, quadratic differentials on Riemann surfaces, and algebraic curves defined over Q, Asian
- Journal of Mathematics
, 1998
"... Abstract. It is well known that there is a bijective correspondence between metric ribbon graphs and compact Riemann surfaces with meromorphic Strebel differentials. In this article, we prove that Grothendieck’s correspondence between dessins d’enfants and Belyi morphisms is a special case of this c ..."
Abstract
-
Cited by 29 (9 self)
- Add to MetaCart
Abstract. It is well known that there is a bijective correspondence between metric ribbon graphs and compact Riemann surfaces with meromorphic Strebel differentials. In this article, we prove that Grothendieck’s correspondence between dessins d’enfants and Belyi morphisms is a special case of this correspondence through an explicit construction of Strebel differentials. For a metric ribbon graph with edge length 1, an algebraic curve over Q and a Strebel differential on it is constructed. It is also shown that the critical trajectories of the measured foliation that is determined by the Strebel differential recover the original metric ribbon graph. Conversely, for every Belyi morphism, a unique Strebel differential is constructed such that the critical leaves of the measured foliation it determines form a metric ribbon graph of edge length 1,
N = 2 topological gauge theory, the Euler characteristic of moduli spaces, and the Casson invariant”, Commun.Math.Phys
- Aspects of NT ≥ 2 topological gauge theories and D-branes”, Nucl.Phys. B492
, 1993
"... We discuss gauge theory with a topological N = 2 symmetry. This theory captures the de Rham complex and Riemannian geometry of some underlying moduli space M and the partition function equals the Euler number χ(M) of M. We explicitly deal with moduli spaces of instantons and of flat connections in t ..."
Abstract
-
Cited by 25 (8 self)
- Add to MetaCart
We discuss gauge theory with a topological N = 2 symmetry. This theory captures the de Rham complex and Riemannian geometry of some underlying moduli space M and the partition function equals the Euler number χ(M) of M. We explicitly deal with moduli spaces of instantons and of flat connections in two and three dimensions. To motivate our constructions we explain the relation between the Mathai-Quillen formalism and supersymmetric quantum mechanics and introduce a new kind of supersymmetric quantum mechanics based on the Gauss-Codazzi equations. We interpret the gauge theory actions from the Atiyah-Jeffrey point of view and relate them to supersymmetric quantum mechanics on spaces of connections. As a consequence 1
private communication
, 1991
"... We present a quadratic-time algorithm for computing the genus distribution of any 3-regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders and other special families of graphs, cubic outer ..."
Abstract
-
Cited by 21 (2 self)
- Add to MetaCart
We present a quadratic-time algorithm for computing the genus distribution of any 3-regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders and other special families of graphs, cubic outerplanar graphs now emerge as the most general family of graphs whose genus distributions are known to be computable in polynomial time. The key algorithmic features are the syntheses of the given outerplanar graph by a sequence of edge-amalgamations of some of its subgraphs, in the order corresponding to the post-order traversal of a plane tree that we call the inner tree, and the coordination of that synthesis with just-in-time root-splitting. Submitted:
Topological matrix models, Liouville matrix model and c = 1 string theory,” arXiv:hep-th/0310287
"... Preprint typeset in JHEP style- HYPER VERSION ..."

