Patterns in permutations and words.

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

• scientific article; zbMATH DE number 2107707
• Generalized permutation patterns -- a short survey
• Combinatorics of permutations
• Combinatorics of permutations
• From permutation patterns to the periodic table

zbMATH Keywords

permutationpatternwordbarred patternvincular patternoccurrence

Mathematics Subject Classification ID

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)

• 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
• On intervals of the consecutive pattern poset
• 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
• Extremal functions of forbidden multidimensional matrices
• Enumerating in Coxeter groups (survey)
• 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
• Permutations, moments, measures
• Exhaustive generation for permutations avoiding (colored) regular sets of patterns
• Sorting Cayley permutations with pattern-avoiding machines
• Word-Representable Graphs: a Survey
• Fertility, Strong Fertility, and Postorder Wilf Equivalence
• Mahonian STAT on words
• 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
• Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)
• Ferromagnetism in \(d\)-dimensional \(\mathrm{SU}(n)\) Hubbard models with nearly flat bands
• Pattern restricted quasi-Stirling permutations
• The equidistribution of some length-three vincular patterns on \(S_n(132)\)
• Sorting by shuffling methods and a queue
• Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
• Enumerating cycles in the graph of overlapping permutations
• Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions
• 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
• Catalan and Schröder permutations sortable by two restricted stacks
• Title not available (Why is that?)
• Counting descent pairs with prescribed tops and bottoms
• Counting subwords in flattened involutions and Kummer functions
• Refined restricted inversion sequences
• On graphs representable by pattern-avoiding words
• Troupes, cumulants, and stack-sorting
• Content and singletons bring unique identification minors
• Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
• The operators \(F_i\) on permutations, 132-avoiding permutations and inversions
• 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
• Popularity of patterns over \(d\)-equivalence classes of words and permutations
• Patterns in Shi tableaux and Dyck paths
• \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon
• 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

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)