Grassmannian permutations avoiding identity

arxiv(2022)

引用 0|浏览3
暂无评分
摘要
A permutation is called Grassmannian if it has at most one descent. The study of pattern avoidance in such permutations was initiated by Gil and Tomasko in 2021. We continue this work by studying Grassmannian permutations that avoid the identity permutation. In particular, we count the Grassmannian permutations of size $m$ avoiding the identity of size $k$, thus solving a conjecture made by Weiner. We also study avoidance of identity in special classes such as odd Grassmannian permutations and Grassmannian involutions.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要