[Paper Review] Permutation patterns: basic definitions and notation

Pilaud, Vincent, Williams, Aaron|arXiv (Cornell University)|Jun 22, 2015

semigroups and automata theory1 references19 citations

TL;DR

This paper provides a comprehensive introduction to permutation patterns, defining core concepts such as containment, avoidance, and structural decompositions (direct sum, skew sum, inflation, intervals, and simplicity). It establishes foundational notation and explores classical and non-classical pattern classes, growth rates, Wilf equivalence, and generating functions, offering a unified framework for studying permutation classes and their combinatorial properties.

ABSTRACT

A brief presentation of basic definitions and notation used in permutation patterns research.

Motivation & Objective

• To systematize and standardize the fundamental definitions and notation used in permutation pattern research.
• To clarify the relationships between permutation structure (e.g., sum and skew decompositions, intervals, simplicity) and pattern containment.
• To establish the theoretical framework for classical and non-classical permutation classes, including avoidance, basis, and closure under subpermutations.
• To explore the asymptotic behavior of permutation classes through growth rates and the Stanley–Wilf conjecture.
• To examine Wilf equivalence and generating functions as tools for classifying and comparing permutation classes.

Proposed method

• Defines permutation containment via order-isomorphism of subsequences and reduction (red(λ)) to formalize pattern occurrence.
• Introduces structural operations: direct sum (⊕), skew sum (⊖), and inflation (σ[τ₁,…,τₘ]) to decompose and reconstruct permutations.
• Characterizes sum and skew indecomposable permutations and introduces layered permutations as direct sums of decreasing permutations.
• Uses graphical representations (plots, shaded regions) to illustrate classical, vincular, bivincular, and mesh patterns.
• Applies extremal point concepts (left-to-right maxima/minima) and classical statistics (descents, inversions, excedances, major index) to analyze permutation structure.
• Defines generating functions and distinguishes rational, algebraic, and other types, linking them to Wilf equivalence and equinumerosity.

Experimental results

Research questions

• RQ1 How can permutation patterns be formally defined and notated in a way that supports consistent research across the field?
• RQ2 What structural properties (e.g., intervals, simplicity, decomposability) characterize permutations and how do they relate to pattern containment?
• RQ3 How do growth rates of permutation classes behave, and what constraints exist on their asymptotic growth?
• RQ4 What conditions lead to Wilf equivalence between permutation classes, and how do symmetries and generating functions play a role?
• RQ5 How do non-classical patterns (barred, vincular, bivincular, mesh) extend the classical framework and what are their avoidance properties?

Key findings

• The subpermutation relation forms a partial order, and classical permutation classes are downsets under this order, closed under taking subsequences.
• Every permutation can be uniquely decomposed into sum indecomposable or skew indecomposable components, and every permutation is the inflation of a unique simple permutation.
• The class Av(123) is equinumerous with the Catalan numbers, and so are Av(132), Av(213), and Av(231), demonstrating non-symmetry-based Wilf equivalence.
• The growth rate of any classical permutation class (other than all permutations) is at most exponential, as established by the Marcos–Tardos theorem.
• Wilf equivalence is equivalent to equality of generating functions, and generating functions can be rational or algebraic, providing tools for classifying pattern-avoiding permutations.
• Mesh patterns generalize classical, vincular, and bivincular patterns by specifying forbidden regions in the plot, enabling a unified framework for pattern avoidance.