On the poset of non-attacking King permutations

DOI10.1016/J.EJC.2020.103119zbMATH Open1439.05002arXiv1905.02387OpenAlexW3021215504MaRDI QIDQ2178672FDOQ2178672

Moriah Sigron, Eli Bagno, Estrella Eisenberg, Shulamit Reches

Publication date: 11 May 2020

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: A king-non-attacking permutation is a permutation $piin{S}_n$ such that $|pi(i)-pi(i-1)|eq1$ for each $iin2,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.

Full work available at URL: https://arxiv.org/abs/1905.02387

Recommendations

• Counting king permutations on the cylinder
• Pattern avoidance in poset permutations
• On pattern avoiding indecomposable permutations
• On the topology of the permutation pattern poset
• A counterexample to King's conjecture
• scientific article; zbMATH DE number 4374
• On the enumeration of permutominoes
• On the kings and kings-of-kings in semicomplete multipartite digraphs
• The order-interval hypergraph of a finite poset and the König property

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius+function&go=Go M��bius function]

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Cites Work

• Title not available (Why is that?)
• Pattern matching for permutations
• Permutation classes
• On two-sided gamma-positivity for simple permutations
• The minimum Manhattan distance and minimum jump of permutations
• Prolific permutations and permuted packings: downsets containing many large patterns
• The Möbius function of permutations with an indecomposable lower bound
• ZEROS OF THE MÖBIUS FUNCTION OF PERMUTATIONS
• The Probability that Neighbors Remain Neighbors After Random Rearrangements

Cited In (3)

• Generalized Dold sequences on partially-ordered sets
• Counting king permutations on the cylinder
• On the sparseness of the downsets of permutations via their number of separators

Uses Software

• OEIS

This page was built for publication: On the poset of non-attacking King permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178672)