1 citations · 1 across the 1 of their papers we have counts for
1 paper
Jennifer Elder, Pamela E. Harris, Zoe Markman +2
A permutation of length n is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened…