2000 character limit reached
On the poset of King-Non-Attacking permutations
Published 7 May 2019 in math.CO | (1905.02387v2)
Abstract: A king-non-attacking permutation is a permutation $\pi \in S_n$ such that $|\pi(i)-\pi(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\"obius function.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
