Location of Repository

On the Asymptotic Number of Plane Curves and Alternating Knots

By Gilles Schaeffer and Paul Zinn-Justin

Abstract

revised, final version to be publishedWe present a conjecture for the power-law exponent in the asymptotic number of types of plane curves as the number of self-intersections goes to infinity. In view of the description of prime alternating links as flype equivalence classes of plane curves, a similar conjecture is made for the asymptotic number of prime alternating knots. The rationale leading to these conjectures is given by quantum field theory. Plane curves are viewed as configurations of loops on a random planar lattices, that are in turn interpreted as a model of 2d quantum gravity with matter. The identification of the universality class of this model yields the conjecture. Since approximate counting or sampling planar curves with more than a few dozens of intersections is an open problem, direct confrontation with numerical data yields no convincing indication on the correctness of our conjectures. However, our physical approach yields a more general conjecture about connected systems of curves. We take advantage of this to design an original and feasible numerical test, based on recent perfect samplers for large planar maps. The numerical datas strongly support our identification with a conformal field theory recently described by Read and Saleur

Topics: [PHYS.MPHY] Physics [physics]/Mathematical Physics [math-ph], [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]
Publisher: Taylor & Francis
Year: 2004
OAI identifier: oai:HAL:hal-00004352v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.