A survey of consecutive patterns in permutations

From MaRDI portal
Publication:2957196

DOI10.1007/978-3-319-24298-9_24zbMath1354.05004arXiv1504.07265OpenAlexW1753747406MaRDI QIDQ2957196

Sergi Elizalde

Publication date: 25 January 2017

Published in: Recent Trends in Combinatorics (Search for Journal in Brave)

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



Related Items

The number of cycles with a given descent set, Wilf equivalence relations for consecutive patterns, On super-strong Wilf equivalence classes of permutations, A central limit theorem for descents of a Mallows permutation and its inverse, Consecutive patterns in inversion sequences II: avoiding patterns of relations, Wilf equivalences between vincular patterns in inversion sequences, Consecutive patterns in Coxeter groups, Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels, Wilf equivalences for patterns in rooted labeled forests, Exact and asymptotic enumeration of cyclic permutations according to descent set, Stanley-Wilf limits for patterns in rooted labeled forests, Stieltjes moment sequences for pattern-avoiding permutations, Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\), A necessary condition for c-Wilf equivalence, Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics, Stack-sorting with consecutive-pattern-avoiding stacks, Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\), Homomorphisms on noncommutative symmetric functions and permutation enumeration, Cyclic pattern containment and avoidance, Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations, The feasible regions for consecutive patterns of pattern-avoiding permutations, A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra