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)
- 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
- On five types of crucial permutations with respect to monotone patterns
- Permutations sortable by two stacks in parallel and quarter plane walks
- Number of cycles in the graph of 312-avoiding permutations
- Wilf equivalences between vincular patterns in inversion sequences
- On the frequencies of patterns of rises and falls
- Reduced decompositions with one repetition and permutation pattern avoidance
- The patterns of permutations
- Ferromagnetism in \(d\)-dimensional \(\mathrm{SU}(n)\) Hubbard models with nearly flat bands
- Shape and pattern containment of separable permutations.
- Counting subwords in flattened partitions of sets
- The range of repetition in reduced decompositions
- Equidistributions of Mahonian statistics over pattern avoiding permutations
- Representing graphs via pattern avoiding words
- On random shifted standard Young tableaux and 132-avoiding sorting networks
- Asymptotics of principal evaluations of Schubert polynomials for layered permutations
- Pattern avoidance in ordered set partitions and words
- Large deviations for permutations avoiding monotone patterns
- Stack-sorting with consecutive-pattern-avoiding stacks
- On a refinement of Wilf-equivalence for permutations
- \((a, b)\)-rectangle patterns in permutations and words
- Stack-sorting preimages of permutation classes
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Restricted non-separable planar maps and some pattern avoiding permutations
- Stack-sorting for words
- Lattice paths and pattern-avoiding uniquely sorted permutations
- Tests and Proofs for Enumerative Combinatorics
- On permutation patterns with constrained gap sizes
- Harmonic numbers, Catalan's triangle and mesh patterns
- Patterns in random permutations
- 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
- On three different notions of monotone subsequences
- On super-strong Wilf equivalence classes of permutations
- Pattern-functions, statistics, and shallow permutations
- 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
- Patterns in inversion sequences. II: 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
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)
