Pattern-Avoiding Shallow Permutations
Published in The Electronic Journal of Combinatorics • Mar 13, 2026
NobleIDNI0P712W920R516S408
Authors:,,
Kassie Archer
Aaron Geary
Robert Laudone
Abstract
Shallow permutations were defined in 1977 to be those that satisfy the lower bound of the Diaconis-Graham inequality. Recently, there has been renewed interest in these permutations. In particular, Berman and Tenner showed they satisfy certain pattern avoidance conditions in their cycle form and Woo...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!