Character expansion methods for matrix models of dually weighted graphs (Q1918106)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Character expansion methods for matrix models of dually weighted graphs
scientific article

    Statements

    Character expansion methods for matrix models of dually weighted graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 November 1996
    0 references
    In the framework of two-dimensional quantum field theory a character expansion technique for a new kind of matrix model describing dually weighted planar graphs is developed. It is shown that by reducing the \(N^2\) degrees of freedom of the original matrix to the \(N\) highest weights specifying the irreducible representations of the group \(U(N)\) one can reduce the problem to a set of integral equations by applying the saddle point method in the large \(N\) limit. These integral equations are solved in a number of known one-matrix models, and also the number of graphs having only even numbers of neighbors for both original and flat lattices is calculated. A description is given of the limiting case of the completely flat lattice by a system of free fermions (the highest weights) with an equidistant spectrum which allows to reproduce correctly the partition function of regular graphs with toric topology. The integral equations corresponding to the transition from completely random planar graphs (describing 2D gravity) to the regular (flat) lattice are also solved.
    0 references
    two-dimensional quantum field theory
    0 references
    character expansion technique
    0 references
    matrix model
    0 references
    dually weighted planar graphs
    0 references
    integral equations
    0 references
    flat lattice
    0 references
    partition function
    0 references
    regular graphs
    0 references
    toric topology
    0 references
    random planar graphs
    0 references
    2D gravity
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references