Two vignettes on full rook placements

zbMATH Open1333.05008arXiv1310.6073MaRDI QIDQ2800767FDOQ2800767

Authors: Jonathan Bloom, Vincent Vatter 

Publication date: 18 April 2016

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Abstract: Using bijections between pattern-avoiding permutations and certain full rook placements on Ferrers boards, we give short proofs of two enumerative results. The first is a simplified enumeration of the 3124, 1234-avoiding permutations, obtained recently by Callan via a complicated decomposition. The second is a streamlined bijection between 1342-avoiding permutations and permutations which can be sorted by two increasing stacks in series, originally due to Atkinson, Murphy, and Ruv{s}kuc.

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

Recommendations

• A simple bijection between 231-avoiding and 312-avoiding placements
• Patterns in matchings and rook placements
• Pattern avoidance in matchings and partitions
• Pattern avoidance in the rook monoid
• Bijections on m-level Rook Placements

zbMATH Keywords

pattern-avoiding permutationsfull rook placements on Ferrers boards

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19)

Cited In (6)

• Passing through a stack \(k\) times with reversals
• A simple bijection between 231-avoiding and 312-avoiding placements
• Generating permutations with restricted containers
• Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
• Permutations avoiding 4321 and 3241 have an algebraic generating function
• Patterns in matchings and rook placements

Uses Software

• OEIS

This page was built for publication: Two vignettes on full rook placements

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