On three different notions of monotone subsequences

MaRDI QIDQ3084739zbMATH OpenFDO

Authors Miklós Bóna

Publication date 25 March 2011

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: We review how the monotone pattern compares to other patterns in terms of enumerative results on pattern avoiding permutations. We consider three natural definitions of pattern avoidance, give an overview of classic and recent formulas, and provide some new results related to limiting distributions.

Recommendations

• Where the monotone pattern (mostly) rules
• Longest monotone subsequences and rare regions of pattern-avoiding permutations
• Permutations avoiding sets of patterns with long monotone subsequences
• Patterns in permutations and words.
• Longest increasing subsequences in pattern-restricted permutations

Cited in

(19)

• Monotone subsequences in (0,1)-matrices
• Monotone subsequence via ultrapower
• Renewal theory for asymmetric \(U\)-statistics
• Weighted dependency graphs
• Universality for random permutations and some other groups
• Central limit theorems for patterns in multiset permutations and set partitions
• Weighted dependency graphs and the Ising model
• Patterns in random permutations avoiding some sets of multiple patterns
• Patterns in random permutations
• Patterns in random permutations avoiding some other patterns
• Mod-\(\phi\) convergence. II: Estimates on the speed of convergence
• Patterns in random permutations avoiding the pattern 132
• Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations
• Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
• Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
• A geometric approach to conjugation-invariant random permutations
• Asymptotics of self-overlapping permutations
• Counting occurrences of patterns in permutations
• Penney's game for permutations

This page was built for publication: On three different notions of monotone subsequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084739)