2011/10/12 by Jonathan Bloom, Bloom, Jonathan, Dan Saracino +1
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1110.2564
openalex publication_date 2011/10/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Stankova and West proved in 2002 that the patterns 231 and 312 are shape-Wilf-equivalent. Their proof was nonbijective and fairly complicated. We give a new characterization of 231 and 312 avoiding full rook placements and use this to give a simple bijective proof of the shape-Wilf- equivalence.