Counting non-planar diagrams: An exact formula (Q5936615): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Replica theory and large-D Josephson junction hypercubic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Lie superalgebras and q-oscillators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meanders: A direct enumeration approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the frustrated spherical model with<b><i>q</i></b>-polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(q\)-Gaussian processes: Non-commutative and classical aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040884 / rank
 
Normal rank

Latest revision as of 17:58, 3 June 2024

scientific article; zbMATH DE number 1613965
Language Label Description Also known as
English
Counting non-planar diagrams: An exact formula
scientific article; zbMATH DE number 1613965

    Statements

    Counting non-planar diagrams: An exact formula (English)
    0 references
    0 references
    2 July 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Feynman diagram enumeration
    0 references
    high temperature loop expansion
    0 references
    frustrated lattice spin model
    0 references