A binomial Laurent phenomenon algebra associated with the complete graph (Q1686222): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polytopal Realizations of Generalized Associahedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid polytopes, nested sets and Bergman fans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster algebras I: Foundations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster algebras. II: Finite type classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(Y\)-systems and generalized associahedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laurent phenomenon algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutohedra, Associahedra, and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested complexes and their polyhedral realizations / rank
 
Normal rank

Latest revision as of 20:59, 14 July 2024

scientific article
Language Label Description Also known as
English
A binomial Laurent phenomenon algebra associated with the complete graph
scientific article

    Statements

    A binomial Laurent phenomenon algebra associated with the complete graph (English)
    0 references
    0 references
    0 references
    21 December 2017
    0 references
    cluster algebra
    0 references
    Laurent polynomial
    0 references
    LP algebra
    0 references
    Laurent phenomenon algebra
    0 references
    graph LP algebra
    0 references
    graph Laurent phenomenon algebra
    0 references
    complete graph
    0 references
    exchange graph
    0 references
    associahedron
    0 references
    polytope
    0 references
    recursion
    0 references

    Identifiers