Patterns in permutations and words.
From MaRDI portal
Publication:632372
DOI10.1007/978-3-642-17333-2zbMATH Open1257.68007OpenAlexW166539567MaRDI QIDQ632372FDOQ632372
Authors: Sergey Kitaev 
Publication date: 16 March 2011
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17333-2
Recommendations
Permutations, words, matrices (05A05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Pattern recognition, speech recognition (68T10) Combinatorics in computer science (68R05) Combinatorics on words (68R15)
Cited In (only showing first 100 items - show all)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
- The operators \(F_i\) on permutations, 132-avoiding permutations and inversions
- Passing through a stack \(k\) times with reversals
- Title not available (Why is that?)
- Pattern-avoiding permutation powers
- Pattern-avoiding inversion sequences and open partition diagrams
- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Representing permutations with few moves
- Existence of \(u\)-representation of graphs
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- Asymptotic behaviour of the containment of certain mesh patterns
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- Rollercoasters and caterpillars
- Ascent sequences avoiding pairs of patterns
- Distributions of several infinite families of mesh patterns
- Fast and longest rollercoasters
- A combinatorial bijection on di-sk trees
- Pattern avoidance in biwords
- Absent subsequences in words
- Inversion sequences avoiding pairs of patterns
- Catalan words avoiding pairs of length three patterns
- Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations
- A decomposition of ballot permutations, pattern avoidance and Gessel walks
- Subregularity in infinitely labeled generating trees of restricted permutations
- Sorting probability of Catalan posets
- Finding and counting permutations via CSPs
- Patterns in Shi tableaux and Dyck paths
- Permutation reconstruction from a few large patterns
- \(k\)-arrangements, statistics, and patterns
- On random shifted standard Young tableaux and 132-avoiding sorting networks
- The \(\gamma \)-positive coefficients arising in segmented permutations
- Refined Wilf-equivalences by Comtet statistics
- On partially ordered patterns of length 4 and 5 in permutations
- Floodings of metric graphs
- Supertrees
- The Eulerian distribution on involutions is indeed \(\gamma\)-positive
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Rollercoasters: Long Sequences without Short Runs
- Equidistributions of mesh patterns of length two
- Restricted generating trees for weak orderings
- Nonlinearity of \(k\)-cycle permutations on \(\mathbb Z_n\)
- A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
- Almost square permutations are typically square
- \(k\)-pop stack sortable permutations and \(2\)-avoidance
- Fertilitopes
- Avoidance of classical patterns by Catalan sequences
- Visibility in restricted involutions
- Pattern-avoiding ascent sequences of length 3
- Structured preferences: a literature survey
- Transport of patterns by Burge transpose
- Some enumerative results related to ascent sequences
- The shape of random pattern-avoiding permutations
- Title not available (Why is that?)
- The \(q\)-exponential generating function for permutations by consecutive patterns and inversions
- Hook formulas for skew shapes. III: Multivariate and product formulas
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
- The sets of flattened partitions with forbidden patterns
- Counting permutations by their rigid patterns
- Recurrence relations in counting the pattern 13-2 in flattened permutations
- Rook and Wilf equivalence of integer partitions
- Enumeration of r-smooth words over a finite alphabet
- Combinatorics of Compositions and Words
- Pattern avoiding meandric permutations
- Locally convex words and permutations
- Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution
- Avoiding vincular patterns on alternating words
- Pattern-avoiding alternating words
- On the topology of the permutation pattern poset
- Recurrence relations for patterns of type (2,1) in flattened permutations
- The Brownian limit of separable permutations
- A sextuple equidistribution arising in pattern avoidance
- Some results on the avoidance of vincular patterns by multisets
- On \(1324\)-avoiding permutations
- Constructing separable Arnold snakes of Morse polynomials
- Vincular pattern avoidance on cyclic permutations
- Eulerian polynomials and descent statistics
- Descent distribution on Catalan words avoiding a pattern of length at most three
- On two unimodal descent polynomials
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
- Structure of random \(312\)-avoiding permutations
- Lyndon words, permutations and trees.
- A linear time algorithm for consecutive permutation pattern matching
- Mahonian STAT on rearrangement class of words
- On pattern avoiding indecomposable permutations
- Cycles in the graph of overlapping permutations avoiding barred patterns
- Counting and generating permutations in regular classes
- Vincular pattern posets and the Möbius function of the quasi-consecutive pattern poset
- On the Möbius function and topology of general pattern posets
- A formula for the Möbius function of the permutation poset based on a topological decomposition
- Permutations and words counted by consecutive patterns
- Stack sorting with increasing and decreasing stacks
- Parity permutation pattern matching
- Square permutations are typically rectangular
- 2-stack sorting is polynomial
- Extremal functions of forbidden multidimensional matrices
- Generalized pattern-matching conditions for \(C_k \wr S_n\)
- Operators of equivalent sorting power and related Wilf-equivalences
- Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees
This page was built for publication: Patterns in permutations and words.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632372)
