Abstract

A king-non-attacking permutation is a permutation π∈Snπ\in S_n such that ∣π(i)−π(i−1)∣≠1|π(i)-π(i-1)|\neq 1 for each i∈{2,…,n}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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.