On 132-Avoiding Permutations with an Adjacency Constraint

Abstract: We study permutations in $S_n$ that simultaneously avoid the pattern $132$ and satisfy the adjacency bound $|π_{i+1} - π_i| \leq m$ for all $i$, denoting their number by $A_n^{(m)}$. This combination of a global pattern restriction and a local bounded-difference condition produces a strong structural collapse: whereas unrestricted $132$-avoiding permutations are counted by the Catalan numbers with exponential growth rate $4$, the adjacency constraint forces the maximum element $n$ to occupy only positions in ${1, 2, \ldots, m} \cup {n}$. We give a complete solution for $m = 2$ by partitioning the class according to the position of the maximum element. This yields explicit recurrences and a rational generating function, from which we derive asymptotic growth of the form $A_n^{(2)} \sim C α^n$ with $α\approx 1.4656$. We conjecture that for each fixed $m$, the class admits a finite-state structural decomposition leading to linear recurrences with constant coefficients and rational generating functions, with growth constants increasing to $4$.

• The paper presents a comprehensive enumeration of 132-avoiding permutations under a bounded adjacency constraint, achieving a finite-state collapse for m=2.
• It employs structural decomposition and generating functions to derive explicit recurrences and asymptotic growth rates, contrasting with classical Catalan behavior.
• The study reveals that local rigidity imposed by adjacency constraints dramatically reduces the complexity of permutation classes, bridging monotone and unrestricted regimes.

Structural Collapse in 132-Avoiding Permutations with Adjacency Constraints

Motivation and Definitions

This paper introduces a combinatorial restriction on $132$-avoiding permutations, requiring that all consecutive entries satisfy a bounded adjacency constraint: $|\pi_{i+1} - \pi_i| \leq m$, for fixed $m$. $132$-avoiding permutations are classically enumerated by the Catalan numbers, exhibiting exponential growth rate $4$. Imposing an adjacency constraint yields a dramatic reduction in complexity, with the family of permutations $A_n^{(m)}$ for fixed $m$ admitting explicit enumeration and structural characterizations.

The main contribution is a comprehensive solution for $m=2$, involving structural decomposition, explicit recurrences, and generating functions. The analysis demonstrates that merging global pattern avoidance with local adjacency constraints engenders a finite-state collapse, profoundly restricting the class.

Classical Structure of 132-Avoiders

A fundamental lemma establishes that in any $132$-avoiding $\pi \in S_n$, if $|\pi_{i+1} - \pi_i| \leq m$0 occurs in position $|\pi_{i+1} - \pi_i| \leq m$1, then all entries to the left of $|\pi_{i+1} - \pi_i| \leq m$2 exceed those to the right, and both sides themselves avoid $|\pi_{i+1} - \pi_i| \leq m$3. This underpins the decomposition associated with Catalan numbers: if $|\pi_{i+1} - \pi_i| \leq m$4 counts such permutations, then $|\pi_{i+1} - \pi_i| \leq m$5. Without adjacency constraints, $|\pi_{i+1} - \pi_i| \leq m$6-avoidance is highly flexible—$|\pi_{i+1} - \pi_i| \leq m$7 can be in any position, yielding quadratic recursive structures.

Impact of the Adjacency Constraint

The adjacency bound $|\pi_{i+1} - \pi_i| \leq m$8 enforces local rigidity. The maximal element $|\pi_{i+1} - \pi_i| \leq m$9 can only appear in positions $m$0, as proven in Theorem~\ref{thm:max-position-general-m}. This is realizable for all $m$1, producing forced boundary configurations and significantly reducing growth rates. For $m$2, only monotone permutations (identity and reverse) are allowed; for $m$3, the constraint is vacuous, reverting to classical Catalan enumeration.

Full Structural Characterization for $m$4

The case $m$5 is resolved via a disjoint partition: $m$6, defined by the position of $m$7.

• $m$8: Maximum at position $m$9. $132$0 satisfies a recurrence: $132$1 for $132$2, with initial conditions $132$3.
• $132$4: Maximum at position $132$5. $132$6 forms a bijection with $132$7.
• $132$8: Maximum at position $132$9. Permutations are classified explicitly into Types $4$0 and $4$1; $4$2.

Combining these yields $4$3.

Explicit Generating Functions and Linear Recurrence

The ordinary generating function for $4$4 is

$4$5

and for $4$6:

$4$7

$4$8 obeys the linear recurrence, for $4$9,

$A_n^{(m)}$0

Asymptotic Analysis

The dominant singularity arises from the real root $A_n^{(m)}$1 of $A_n^{(m)}$2, $A_n^{(m)}$3, yielding exponential growth rate $A_n^{(m)}$4, with asymptotics $A_n^{(m)}$5 and $A_n^{(m)}$6. This is notably less than the unrestricted Catalan rate ($A_n^{(m)}$7).

Conjectures and Structural Generalization

The authors conjecture that for all fixed $A_n^{(m)}$8:

• The class $A_n^{(m)}$9 admits finite-state decomposition, linear recurrence with constant coefficients, and rational generating function.
• The exponential growth rate $m$0 satisfies $m$1, interpolating between rigid and classical Catalan regimes.

Data for $m$2 supports these assertions, although the state complexity increases.

Implications and Future Directions

This work demonstrates that the synthesis of global and local combinatorial restrictions yields finite-state classes with tractable enumeration. The existence of rational generating functions and constant-coefficient recurrences for such permutation families has direct implications for algorithmic combinatorics and the analysis of pattern-restricted structures.

Future research should focus on:

• Complete structural and analytic characterization for $m$3 and general $m$4.
• Determining the order and complexity of recurrences as functions of $m$5.
• Establishing bijections or interpretations connecting adjacency-constrained classes to other Catalan-type objects (e.g., Dyck paths with bounded slope, mesh patterns).
• Analyzing limiting behaviors and phase transitions as $m$6 increases.

The results indicate a sharp phase transition between monotone rigidity and Catalan flexibility, governed by the local adjacency bound. Theoretical implications extend to Lipschitz-type permutation classes, generalized pattern avoidance, and connections with permutation automata.

Conclusion

The paper provides a rigorous structural and enumerative solution for $m$7-avoiding permutations under a discrete adjacency constraint for $m$8, including an explicit recurrence and rational generating function. The findings motivate a general theory of finite-state permutation classes defined by the intersection of global pattern and local adjacency constraints, with open questions concerning higher $m$9, asymptotics, and combinatorial interpretations.