Asymptotics of self-overlapping permutations
From MaRDI portal
Cites work
- A survey of consecutive patterns in permutations
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays
- Consecutive patterns in permutations
- Counting permutations by their rigid patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- From Hertzsprung's problem to pattern-rewriting systems
- Generating asymptotics for factorially divergent sequences
- scientific article; zbMATH DE number 2186865 (Why is no real title available?)
- scientific article; zbMATH DE number 41707 (Why is no real title available?)
- scientific article; zbMATH DE number 3389044 (Why is no real title available?)
- Indecomposable permutations, hypermaps and labeled Dyck paths
- Minimal overlapping patterns in colored permutations
- Non-overlapping permutation patterns
- On three different notions of monotone subsequences
- Restricted permutations
- Restricted permutations and the wreath product
- Simple permutations and pattern restricted permutations
- Symbolic method and directed graph enumeration
- The Goulden—Jackson cluster method: extensions, applications and implementations
- The most and the least avoided consecutive patterns
This page was built for publication: Asymptotics of self-overlapping permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016882)