Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
复制标题
格子路径和模式避免唯一排序的排列
DOI:
--
复制
发表时间:
2019
影响因子:
0.7
通讯作者:
H. Mularczyk
中科院分区:
文献类型:
--
作者:
H. Mularczyk
We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of length four by establishing bijections between these classes and various lattice paths. This allows us to prove nine conjectures of Defant.