Growing Avoiders from the Right: An Operator-Theoretic Approach

(Work in progress) Marcus and Tardos \cite{MarcusTardos2004} proved the Stanley–Wilf conjecture by reducing pattern avoidance to an extremal problem on $0$–$1$ matrices. We give a parallel proof for classical permutation patterns that stays entirely in the grow from the right'' world of enumerative combinatorics. A $v$-avoiding permutation is built by right insertion; at each step we keep a pruned family of locations of $(k{-}1)$-partial occurrences of $v$ (the \emph{frontier}), each carrying its forbidden rank interval. The insertion step then induces a nonnegative transfer operator on a doubly weighted $\ell^\infty$ space. A quadratic penalty in the length makes this operator bounded, and a Neumann-series argument on a natural separable predual yields analyticity of the growth series, hence finite exponential growth for $\Av(v)$. The formulation is completely internal -- we never pass to $0$--$1$ matrices -- and it cleanly separates the pattern-dependent combinatorics of the frontier from a purely operator-theoretic core. In particular, we obtain an abstract right-insertion/transfer-operator’’ theorem: any system whose frontier grows at most linearly and whose transfer operator satisfies a uniform quadratic length bound has an analytic growth series.

💡 Research Summary

The paper presents a new proof of the Stanley–Wilf conjecture for classical permutation patterns that stays entirely within the “grow‑from‑the‑right” paradigm familiar to enumerative combinatorics, avoiding the traditional reduction to 0‑1 matrices used by Marcus and Tardos. The authors fix a pattern (v\in S_k) and build permutations by repeatedly inserting a new entry at the rightmost position. Each insertion is described by a rank (r\in{1,\dots,n+1}); this is exactly the Lehmer code representation of permutations.

To guarantee that the growing permutation never contains a copy of (v), the paper introduces the notion of a frontier. For a permutation (\pi) that avoids (v), a ((k-1))-partial occurrence is a set of indices whose values are order‑isomorphic to the first (k-1) entries of (v). For each such partial occurrence the authors define a forbidden rank set (J_\pi), consisting of all ranks (r) that would complete the pattern (v) when the new rightmost entry is inserted with rank (r). Lemma 2.5 shows that each (J_\pi) is an interval of consecutive integers. The union of all these intervals is called the frontier block (\operatorname{Forb}_v(\pi)); the admissible ranks for the next insertion are the complement (A_v(\pi)={1,\dots,n+1}\setminus\operatorname{Forb}_v(\pi)).

The state of the construction is the pair ((\pi,F_v(\pi))) where (F_v(\pi)) is the collection of ((k-1))-partial occurrences that have non‑empty forbidden intervals. The authors define two statistics on a state (x): the frontier size (m(x)=|F_v(\pi)|) and the length (s(x)=|\pi|). The insertion operator (T) maps a state to the sum of all states obtained by inserting each admissible rank (r\in A_v(x)).

A major technical obstacle is that the number of admissible ranks grows linearly with the length, so a simple (\ell^\infty) norm would make (T) unbounded. The authors resolve this by working on a doubly weighted (\ell^\infty) space. One weight penalises the frontier size exponentially (e.g., factor (2^{m(x)})), while a second weight penalises the length quadratically (e.g., factor (\exp(-c,s(x)^2))). With these weights the insertion operator becomes bounded even at the formal variable (z=1).

Having a bounded operator on a Banach space, the paper turns to its dual. The adjoint (T^) acts on a separable predual consisting of finitely supported functions on the state space. For a complex variable (z) with (|z|) sufficiently small, the Neumann series (\sum_{n\ge0}(zT^)^n) converges in operator norm. This series represents the growth generating function \