The number of monotone triangles with prescribed bottom row
Abstract
We show that the number of monotone triangles with prescribed bottom row (k1,...,kn) is given by a simple product formula which remarkably involves (shift) operators. Monotone triangles with bottom row (1,2,...,n) are in bijection with n × n alternating sign matrices.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.