On the poset of King-Non-Attacking permutations
Combinatorics
2020-03-10 v2
Abstract
A king-non-attacking permutation is a permutation such that for each . We investigate the structure of the poset of these permutations under the containment relation, and also provide some results on its M\"obius function.
Cite
@article{arxiv.1905.02387,
title = {On the poset of King-Non-Attacking permutations},
author = {Eli Bagno and Estrella Eisenberg and Shulamit Reches and Moriah Sigron},
journal= {arXiv preprint arXiv:1905.02387},
year = {2020}
}