On the poset of King-Non-Attacking permutations
Abstract
A king-non-attacking permutation is a permutation π ∈ Sn such that |π(i)-π(i-1)|≠ 1 for each i ∈ \2,…,n\. We investigate the structure of the poset of these permutations under the containment relation, and also provide some results on its M\"obius function.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.