A Spectral Approach to Consecutive Pattern-Avoiding Permutations

We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method which solves this enumeration problem using the spectral theory...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Ehrenborg, Richard, Kitaev, Sergey, Perry, Peter
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics Mathematics - Spectral Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!