Permutation pattern avoidance, alternating sign matrices, and asymptotics (Justin Troyka, Cal State LA)
Permutation pattern avoidance, alternating sign matrices, and asymptotics (Justin Troyka, Cal State LA)
A big area in combinatorics over the last several decades has been the study of pattern-avoiding permutations, whose enumeration is exciting and mysterious. Alternating sign matrices (ASMs) are a generalization of permutations whose study in combinatorics has also been exciting and mysterious. In this talk, I will explain some new asymptotic results involving the number […]