Develops a finite-state decomposition to prove that the generating function for adjacency-constrained 132-avoiding permutations is rational for each fixed m and analyzes its asymptotics.
Enumeration schemes for restricted permutations.Combinatorics, Probability and Computing, 17(1):137–159, 2008
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finite-state enumeration of adjacency-constrained 132-avoiding permutations
Develops a finite-state decomposition to prove that the generating function for adjacency-constrained 132-avoiding permutations is rational for each fixed m and analyzes its asymptotics.