Patterns in permutations and words.
From MaRDI portal
Publication:632372
DOI10.1007/978-3-642-17333-2zbMath1257.68007MaRDI 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
68R05: Combinatorics in computer science
68R15: Combinatorics on words
05A05: Permutations, words, matrices
68T10: Pattern recognition, speech recognition
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
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, 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, Harmonic numbers, Catalan's triangle and mesh patterns, Some enumerative results related to ascent sequences, A linear time algorithm for consecutive permutation pattern matching, The shape of random pattern-avoiding permutations, Equivalence classes of permutations modulo replacements between 123 and two-integer patterns, Permutations sortable by two stacks in parallel and quarter plane walks, Operators of equivalent sorting power and related Wilf-equivalences, Number of cycles in the graph of 312-avoiding permutations, Some results on the avoidance of vincular patterns by multisets, Representing graphs via pattern avoiding words, Large deviations for permutations avoiding monotone patterns, Descent distribution on Catalan words avoiding a pattern of length at most three, On two unimodal descent polynomials, Cycles in the graph of overlapping permutations avoiding barred patterns, Counting and generating permutations in regular classes, Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees, The \(q\)-exponential generating function for permutations by consecutive patterns and inversions, Permutations and words counted by consecutive patterns, Mahonian STAT on words, Counting descent pairs with prescribed tops and bottoms, Tests and proofs for custom data generators, On super-strong Wilf equivalence classes of permutations, The Brownian limit of separable permutations, On (shape-)Wilf-equivalence for words, On the dual complexity and spectra of some combinatorial functions, The equidistribution of some length-three vincular patterns on \(S_n(132)\), Vincular pattern posets and the Möbius function of the quasi-consecutive pattern poset, Enumerating cycles in the graph of overlapping permutations, A sextuple equidistribution arising in pattern avoidance, Equidistributions of Mahonian statistics over pattern avoiding permutations, A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals, Algorithms for testing occurrences of length 4 patterns in permutations, On graphs representable by pattern-avoiding words, On the Möbius function and topology of general pattern posets, 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, Pattern posets, Rook and Wilf equivalence of integer partitions, On the frequencies of patterns of rises and falls, Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3, Reduced decompositions with one repetition and permutation pattern avoidance, Generalized pattern-matching conditions for \(C_k \wr S_n\), Bijective proofs of recurrences involving two Schröder triangles, Staircase patterns in words: subsequences, subwords, and separation number, 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, Constructing separable Arnold snakes of Morse polynomials, Catalan and Schröder permutations sortable by two restricted stacks, Pattern statistics in faro words and permutations, 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, 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, Asymptotic behaviour of the containment of certain mesh patterns, Fast and longest rollercoasters, Troupes, cumulants, and stack-sorting, A combinatorial bijection on di-sk trees, Pattern avoidance of \([4,k\)-pairs in circular permutations], A decomposition of ballot permutations, pattern avoidance and Gessel walks, Subregularity in infinitely labeled generating trees of restricted permutations, Patterns in Shi tableaux and Dyck paths, Sorting by shuffling methods and a queue, Supertrees, Floodings of metric graphs, Polyurethane toggles, A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate, Pattern-avoiding permutation powers, Stack-sorting preimages of permutation classes, Pattern-avoiding inversion sequences and open partition diagrams, Stieltjes moment sequences for pattern-avoiding permutations, The range of repetition in reduced decompositions, A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples, Fertility monotonicity and average complexity of the stack-sorting map, On \(\underline{12} 0\)-avoiding inversion and ascent sequences, Pattern avoidance in biwords, Block decomposition and statistics arising from permutation tableaux, On \(1324\)-avoiding permutations, On a refinement of Wilf-equivalence for permutations, Ascent sequences avoiding pairs of patterns, Exhaustive generation for permutations avoiding (colored) regular sets of patterns, Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions, Patterns of relation triples in inversion and ascent sequences, Vincular patterns in inversion sequences, Distributions of several infinite families of mesh patterns, Stack sorting with increasing and decreasing stacks, Word-Representable Graphs: a Survey, Zig-zag facial total-coloring of plane graphs, Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations, Nonlinearity of k-cycle permutations on ℤn, Passing through a stack k times, Asymptotics of principal evaluations of Schubert polynomials for layered permutations, Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Existence of u -Representation of Graphs, Permutations, Moments, Measures, Avoidance of classical patterns by Catalan sequences, Unnamed Item, Schröder partitions, Schröder tableaux and weak poset patterns, Sorting Cayley permutations with pattern-avoiding machines, Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations, Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations, Enumerating in Coxeter Groups (Survey), $k$-Arrangements, Statistics, and Patterns, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, Rollercoasters and Caterpillars, Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations, Catalan words avoiding pairs of length three patterns, Visibility in restricted involutions, Fertility, Strong Fertility, and Postorder Wilf Equivalence, The sets of flattened partitions with forbidden patterns, CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS, Ascending runs in permutations and valued Dyck paths, Rollercoasters: Long Sequences without Short Runs, Recurrence relations in counting the pattern 13-2 in flattened permutations, Pattern restricted quasi-Stirling permutations, On pattern avoiding indecomposable permutations, Unnamed Item, The enumeration of generalized Tamari intervals, Refined restricted inversion sequences, Recurrence relations for patterns of type (2,1) in flattened permutations, Combinatorics and algorithms for quasi-chain graphs, On random shifted standard Young tableaux and 132-avoiding sorting networks, On random shifted standard Young tableaux and 132-avoiding sorting networks, Combinatorial generation via permutation languages. I. Fundamentals, Further enumeration results concerning a recent equivalence of restricted inversion sequences, Counting subword patterns in permutations arising as flattened partitions of sets, Set Partition Patterns and the Dimension Index, On pattern-avoiding Fishburn permutations, Popularity of patterns over \(d\)-equivalence classes of words and permutations, On partially ordered patterns of length 4 and 5 in permutations, The operators \(F_i\) on permutations, 132-avoiding permutations and inversions, Passing through a stack \(k\) times with reversals, Occurrence graphs of patterns in permutations, Distributions of mesh patterns of short lengths, From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns, Hook formulas for skew shapes. III: Multivariate and product formulas, Mahonian STAT on rearrangement class of words, Frame patterns in \(n\)-cycles, \((a, b)\)-rectangle patterns in permutations and words, On the topology of the permutation pattern poset, Counting subwords in flattened partitions of sets, Eulerian polynomials and descent statistics, Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\), 2-stack sorting is polynomial, Prolific permutations and permuted packings: downsets containing many large patterns, Extremal functions of forbidden multidimensional matrices, Pattern avoidance in ordered set partitions and words, Longest monotone subsequences and rare regions of pattern-avoiding permutations, \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon, The Eulerian distribution on involutions is indeed \(\gamma\)-positive, Restricted non-separable planar maps and some pattern avoiding permutations, Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations, Square permutations are typically rectangular, Ferromagnetism in \(d\)-dimensional \(\mathrm{SU}(n)\) Hubbard models with nearly flat bands, The \(\gamma \)-positive coefficients arising in segmented permutations, Wilf equivalences between vincular patterns in inversion sequences, \(k\)-pop stack sortable permutations and \(2\)-avoidance, Patterns in random permutations, The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three, Permutations encoding the local shape of level curves of real polynomials via generic projections, Tests and Proofs for Enumerative Combinatorics, Representing Permutations with Few Moves, Structure of random 312-avoiding permutations, UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS, Counting subwords in flattened involutions and Kummer functions, Counting pattern avoiding permutations by number of movable letters, Stack-sorting for Words, Inversion sequences avoiding pairs of patterns
