Patterns in permutations and words.
From MaRDI portal
Publication:632372
DOI10.1007/978-3-642-17333-2zbMath1257.68007OpenAlexW166539567MaRDI QIDQ632372
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
Combinatorics in computer science (68R05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Pattern recognition, speech recognition (68T10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (only showing first 100 items - show all)
A combinatorial bijection on di-sk trees ⋮ Locally convex words and permutations ⋮ Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution ⋮ Avoiding vincular patterns on alternating words ⋮ Tests and proofs for custom data generators ⋮ Pattern-avoiding alternating words ⋮ Pattern avoidance of \([4,k\)-pairs in circular permutations] ⋮ The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic ⋮ A fast algorithm for permutation pattern matching based on alternating runs ⋮ On super-strong Wilf equivalence classes of permutations ⋮ A decomposition of ballot permutations, pattern avoidance and Gessel walks ⋮ The \(q\)-exponential generating function for permutations by consecutive patterns and inversions ⋮ Subregularity in infinitely labeled generating trees of restricted permutations ⋮ Patterns in Shi tableaux and Dyck paths ⋮ Sorting by shuffling methods and a queue ⋮ The Brownian limit of separable permutations ⋮ On (shape-)Wilf-equivalence for words ⋮ On the dual complexity and spectra of some combinatorial functions ⋮ Permutations and words counted by consecutive patterns ⋮ The equidistribution of some length-three vincular patterns on \(S_n(132)\) ⋮ Supertrees ⋮ Floodings of metric graphs ⋮ Harmonic numbers, Catalan's triangle and mesh patterns ⋮ Vincular pattern posets and the Möbius function of the quasi-consecutive pattern poset ⋮ Some enumerative results related to ascent sequences ⋮ A linear time algorithm for consecutive permutation pattern matching ⋮ Enumerating cycles in the graph of overlapping permutations ⋮ The shape of random pattern-avoiding permutations ⋮ Polyurethane toggles ⋮ A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate ⋮ Equivalence classes of permutations modulo replacements between 123 and two-integer patterns ⋮ A sextuple equidistribution arising in pattern avoidance ⋮ Mahonian STAT on words ⋮ Equidistributions of Mahonian statistics over pattern avoiding permutations ⋮ A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals ⋮ Pattern-avoiding permutation powers ⋮ Algorithms for testing occurrences of length 4 patterns in permutations ⋮ Stack-sorting preimages of permutation classes ⋮ Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 ⋮ Pattern-avoiding inversion sequences and open partition diagrams ⋮ Reduced decompositions with one repetition and permutation pattern avoidance ⋮ Generalized pattern-matching conditions for \(C_k \wr S_n\) ⋮ Stieltjes moment sequences for pattern-avoiding permutations ⋮ On graphs representable by pattern-avoiding words ⋮ Permutations sortable by two stacks in parallel and quarter plane walks ⋮ Operators of equivalent sorting power and related Wilf-equivalences ⋮ The range of repetition in reduced decompositions ⋮ A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples ⋮ Number of cycles in the graph of 312-avoiding permutations ⋮ Fertility monotonicity and average complexity of the stack-sorting map ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Some results on the avoidance of vincular patterns by multisets ⋮ On the Möbius function and topology of general pattern posets ⋮ Representing graphs via pattern avoiding words ⋮ Counting consecutive pattern matches in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\) ⋮ Counting descent pairs with prescribed tops and bottoms ⋮ Inglenook shunting puzzles ⋮ Pattern avoidance in biwords ⋮ Enumeration of inversion sequences avoiding triples of relations ⋮ Block decomposition and statistics arising from permutation tableaux ⋮ Large deviations for permutations avoiding monotone patterns ⋮ Pattern posets ⋮ Bijective proofs of recurrences involving two Schröder triangles ⋮ Staircase patterns in words: subsequences, subwords, and separation number ⋮ Rook and Wilf equivalence of integer partitions ⋮ On \(1324\)-avoiding permutations ⋮ On a refinement of Wilf-equivalence for permutations ⋮ Ascent sequences avoiding pairs of patterns ⋮ The pure descent statistic on permutations ⋮ Reduced word manipulation: patterns and enumeration ⋮ Equidistributions of mesh patterns of length two and Kitaev and Zhang's conjectures ⋮ Permutation groups arising from pattern involvement ⋮ Exhaustive generation for permutations avoiding (colored) regular sets of patterns ⋮ Constructing separable Arnold snakes of Morse polynomials ⋮ On the frequencies of patterns of rises and falls ⋮ Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions ⋮ Descent distribution on Catalan words avoiding a pattern of length at most three ⋮ On two unimodal descent polynomials ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Cycles in the graph of overlapping permutations avoiding barred patterns ⋮ Catalan and Schröder permutations sortable by two restricted stacks ⋮ Pattern statistics in faro words and permutations ⋮ Counting and generating permutations in regular classes ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ Lower bounds for superpatterns and universal sequences ⋮ The \(r\)-Stirling numbers of the first kind in terms of the Möbius function ⋮ Sorting probability of Catalan posets ⋮ Finding and counting permutations via CSPs ⋮ Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees ⋮ Permutations avoiding certain partially-ordered patterns ⋮ Permutation reconstruction from a few large patterns ⋮ Refined Wilf-equivalences by Comtet statistics ⋮ Pattern occurrences in \(k\)-ary words revisited: a few new and old observations ⋮ Almost square permutations are typically square ⋮ Pattern-avoiding ascent sequences of length 3 ⋮ Structured preferences: a literature survey ⋮ Pattern-functions, statistics, and shallow permutations ⋮ Asymptotic behaviour of the containment of certain mesh patterns ⋮ Fast and longest rollercoasters ⋮ Troupes, cumulants, and stack-sorting
This page was built for publication: Patterns in permutations and words.
