We represent Gelfand-Tsetlin patters as weakly decreasing across rows and the first row being the longest row. The first parameter is the length of the top row and the second parameter is the maximum entry.
distribution search