A king-non-attacking permutation is a permutation $π\in S_n$ such that $|π(i)-π(i-1)|\neq 1$ for each $i \in \{2,\dots,n\}$. We investigate the structure of the poset of these permutations under the containment relation, and also provide some results on its Möbius function.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。