The number of monotone triangles with prescribed bottom row (Q863313): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4705310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for proving polynomial enumeration formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another refinement of the Bender-Knuth (ex-)conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry classes of alternating-sign matrices under one roof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating sign matrices and descending plane partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinants and alternating sign matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the alternating sign matrix conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the refined alternating sign matrix conjecture / rank
 
Normal rank

Latest revision as of 12:07, 25 June 2024

scientific article
Language Label Description Also known as
English
The number of monotone triangles with prescribed bottom row
scientific article

    Statements

    The number of monotone triangles with prescribed bottom row (English)
    0 references
    0 references
    26 January 2007
    0 references
    The author shows that the number of monotone triangles with prescribed bottom row \((k_1,\dots,k_n)\), \(k_1<\cdots<k_n\), is given by a simple product formula which involves shift operators. Monotone triangles with bottom row \((1,2,\dots,n)\) are proven to be in bijection with \(n\times n\) alternating sign matrices.
    0 references

    Identifiers