A spectral approach to consecutive pattern-avoiding permutations

DOI10.4310/JOC.2011.V2.N3.A1zbMath1247.05013arXiv1009.2119MaRDI QIDQ446004

Sergey Kitaev, Richard Ehrenborg, Peter A. Perry

Publication date: 28 August 2012

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.2119

zbMATH Keywords

enumeration problemWarlimont's conjecture

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Symmetric groups (20B30)

Related Items (16)

Asymptotics of the Euler number of bipartite graphs ⋮ A probabilistic approach to consecutive pattern avoiding in permutations ⋮ The expectation of the Vandermonde product squared for uniform random variables ⋮ The boustrophedon transform for descent polytopes ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Wilf equivalences for patterns in rooted labeled forests ⋮ Stanley-Wilf limits for patterns in rooted labeled forests ⋮ The \(f\)-vector of the descent polytope ⋮ Number of cycles in the graph of 312-avoiding permutations ⋮ On uniquely \(k\)-determined permutations ⋮ Clusters, generating functions and asymptotics for consecutive patterns in permutations ⋮ Descent pattern avoidance ⋮ Cyclically Consecutive Permutation Avoidance ⋮ Cycles in the graph of overlapping permutations avoiding barred patterns ⋮ Counting and generating permutations in regular classes ⋮ On the generating function for consecutively weighted permutations

This page was built for publication: A spectral approach to consecutive pattern-avoiding permutations