Six bijections between deco polyominoes and permutations

2008/10/16 by Emeric Deutsch, Deutsch, Emeric, Elisa Pergola +3
Computer Science · Mathematics · #05A05 #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.0810.2876

openalex publication_date 2008/10/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we establish six bijections between a particular class of polyominoes, called deco polyominoes, enumerated according to their directed height by n!, and permutations. Each of these bijections allows us to establish different correspondences between classical statistics on deco polyominoes and on permutations.

Citations

• Some Combinatorial Properties of Schubert Polynomials

Related

• Permutations defining convex permutominoes
• The excedances and descents of bi-increasing permutations
• On the exhaustive generation of convex permutominoes
• A bijection for length-5 patterns in permutations
• Permutation Tableaux and Permutation Patterns