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
- Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations
- 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
- Ascent sequences avoiding pairs of patterns
- Distributions of several infinite families of mesh patterns
- Fast and longest rollercoasters
- $k$-Arrangements, Statistics, and Patterns
- A combinatorial bijection on di-sk trees
- Pattern avoidance in biwords
- Absent subsequences in words
- Inversion sequences avoiding pairs of patterns
- Nonlinearity of k-cycle permutations on ℤn
- Catalan words avoiding pairs of length three patterns
- Passing through a stack k times
- 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
- 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
- Existence of u -Representation of Graphs
- Rollercoasters and Caterpillars
- 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
- 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
- Title not available (Why is that?)
- Staircase patterns in words: subsequences, subwords, and separation number
- Universal graphs and universal permutations
- Title not available (Why is that?)
- Fertility monotonicity and average complexity of the stack-sorting map
- Enumerating in Coxeter Groups (Survey)
- On three different notions of monotone subsequences
- On super-strong Wilf equivalence classes of permutations
- Pattern-functions, statistics, and shallow permutations
- Permutations, Moments, Measures
- Bijective proofs of recurrences involving two Schröder triangles
- Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)
- Inglenook shunting puzzles
- Enumeration of inversion sequences avoiding triples of relations
- Tests and proofs for custom data generators
- Pattern posets
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Reduced word manipulation: patterns and enumeration
- Pattern statistics in faro words and permutations
- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations
- The \(r\)-Stirling numbers of the first kind in terms of the Möbius function
- Equidistributions of mesh patterns of length two and Kitaev and Zhang's conjectures
- Permutation groups arising from pattern involvement
- Block decomposition and statistics arising from permutation tableaux
- Polyurethane toggles
- The pure descent statistic on permutations
- Prolific permutations and permuted packings: downsets containing many large patterns
- Distributions of mesh patterns of short lengths
- Frame patterns in \(n\)-cycles
- Lower bounds for superpatterns and universal sequences
- Permutations avoiding certain partially-ordered patterns
- On (shape-)Wilf-equivalence for words
- On the dual complexity and spectra of some combinatorial functions
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns
- Sorting Cayley permutations with pattern-avoiding machines
- Popularity of patterns over \(d\)-equivalence classes of words and permutations
- Word-Representable Graphs: a Survey
- Fertility, Strong Fertility, and Postorder Wilf Equivalence
- Mahonian STAT on words
- \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon
- Counting covered fixed points and covered arcs in an involution
- On pattern-avoiding Fishburn permutations
- Stieltjes moment sequences for pattern-avoiding permutations
- Permutations avoiding the complement of a regular permutation group
- The enumeration of generalized Tamari intervals
- CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS
- Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)
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)
