Coloring random triangulations

被引:16
|
作者
Di Francesco, P [1 ]
Eynard, B
Guitter, E
机构
[1] Univ N Carolina, Dept Math, Chapel Hill, NC 27599 USA
[2] Univ Durham, Dept Math Sci, Sci Labs, Durham DH1 3HP, England
[3] CEA Saclay, Serv Phys Theor, F-91191 Gif Sur Yvette, France
基金
美国国家科学基金会;
关键词
coloring; folding; random lattice; 2D quantum gravity;
D O I
10.1016/S0550-3213(98)00037-6
中图分类号
O412 [相对论、场论]; O572.2 [粒子物理学];
学科分类号
摘要
We introduce and solve a two-matrix model for the tri-coloring problem of the vertices of a random triangulation. We present three different solutions: (i) by orthogonal polynomial techniques, (ii) by use of a discrete Hirota bilinear equation, (iii) by direct expansion. The model is found to lie in the universality class of pure two-dimensional quantum gravity, despite the non-polynomiality of its potential. (C) 1998 Elsevier Science B.V.
引用
收藏
页码:543 / 587
页数:45
相关论文
共 50 条
  • [31] Coloring Graphs with Dense Neighborhoods
    Rabern, Landon
    JOURNAL OF GRAPH THEORY, 2014, 76 (04) : 323 - 340
  • [32] The normativity objection and the coloring strategy
    Zhao, Xinkan
    SYNTHESE, 2024, 204 (03)
  • [33] Improved Dynamic Graph Coloring
    Solomon, Shay
    Wein, Nicole
    ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (03)
  • [34] Sectionable Tournaments: their Topology and Coloring
    Zakir Deniz
    Order, 2023, 40 : 469 - 491
  • [35] Coloring Geometric Range Spaces
    Aloupis, Greg
    Cardinal, Jean
    Collette, Sebastien
    Langerman, Stefan
    Smorodinsky, Shakhar
    DISCRETE & COMPUTATIONAL GEOMETRY, 2009, 41 (02) : 348 - 362
  • [36] Star Coloring of Sparse Graphs
    Bu, Yuehua
    Cranston, Daniel W.
    Montassier, Mickael
    Raspaud, Andre
    Wang, Weifan
    JOURNAL OF GRAPH THEORY, 2009, 62 (03) : 201 - 219
  • [37] LOCAL COLORING FOR THE MYCIELSKIAN OF A GRAPH
    Deepa, P.
    Srinivasan, P.
    Sundarakannan, M.
    UTILITAS MATHEMATICA, 2018, 106 : 301 - 314
  • [38] Local edge coloring of graphs
    Deepa, P.
    Srinivasan, P.
    Sundarakannan, M.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2021, 18 (01) : 29 - 32
  • [39] Proper Coloring of Geometric Hypergraphs
    Keszegh, Balazs
    Palvolgyi, Domotor
    DISCRETE & COMPUTATIONAL GEOMETRY, 2019, 62 (03) : 674 - 689
  • [40] Parameterized (Approximate) Defective Coloring
    Belmonte, Remy
    Lampis, Michael
    Mitsou, Valia
    35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96