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)
Eulerian polynomials and descent statistics ⋮ Grass(mannian) trees and forests: Variations of the exponential formula, with applications to the momentum amplituhedron ⋮ Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\) ⋮ 2-stack sorting is polynomial ⋮ Enumeration of r-smooth words over a finite alphabet ⋮ La trace et le deltoïde de \boldmath𝑆𝑈(3) ⋮ Unnamed Item ⋮ Linear-sized independent sets in random cographs and increasing subsequences in separable permutations ⋮ On the sparseness of the downsets of permutations via their number of separators ⋮ The combinatorics of Jeff Remmel ⋮ Schröder partitions, Schröder tableaux and weak poset patterns ⋮ Word-Representable Graphs: a Survey ⋮ Zig-zag facial total-coloring of plane graphs ⋮ 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 ⋮ Set Partition Patterns and the Dimension Index ⋮ The \(\gamma \)-positive coefficients arising in segmented permutations ⋮ Prolific permutations and permuted packings: downsets containing many large patterns ⋮ Wilf equivalences between vincular patterns in inversion sequences ⋮ Extremal functions of forbidden multidimensional matrices ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations ⋮ \(k\)-pop stack sortable permutations and \(2\)-avoidance ⋮ Pattern avoidance in ordered set partitions and words ⋮ Patterns in random permutations ⋮ The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three ⋮ Longest monotone subsequences and rare regions of pattern-avoiding permutations ⋮ \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon ⋮ Permutations encoding the local shape of level curves of real polynomials via generic projections ⋮ Unnamed Item ⋮ Inversion sequences avoiding pairs of patterns ⋮ Equidistributions of mesh patterns of length two ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ The Eulerian distribution on involutions is indeed \(\gamma\)-positive ⋮ Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations ⋮ Counting subwords in flattened involutions and Kummer functions ⋮ On five types of crucial permutations with respect to monotone patterns ⋮ Unnamed Item ⋮ Enumerating in Coxeter Groups (Survey) ⋮ Absent subsequences in words ⋮ Nonlinearity of k-cycle permutations on ℤn ⋮ $k$-Arrangements, Statistics, and Patterns ⋮ Restricted non-separable planar maps and some pattern avoiding permutations ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Passing through a stack k times ⋮ Asymptotics of principal evaluations of Schubert polynomials for layered permutations ⋮ Rollercoasters and Caterpillars ⋮ The enumeration of generalized Tamari intervals ⋮ Refined restricted inversion sequences ⋮ Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations ⋮ Catalan words avoiding pairs of length three patterns ⋮ Visibility in restricted involutions ⋮ Unnamed Item ⋮ Recurrence relations for patterns of type (2,1) in flattened permutations ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Vincular patterns in inversion sequences ⋮ On pattern avoiding indecomposable permutations ⋮ Distributions of several infinite families of mesh patterns ⋮ Stack sorting with increasing and decreasing stacks ⋮ Combinatorics and algorithms for quasi-chain graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On pattern-avoiding Fishburn permutations ⋮ The sets of flattened partitions with forbidden patterns ⋮ Popularity of patterns over \(d\)-equivalence classes of words and permutations ⋮ Unnamed Item ⋮ CONTENT AND SINGLETONS BRING UNIQUE IDENTIFICATION MINORS ⋮ Counting pattern avoiding permutations by number of movable letters ⋮ Ascending runs in permutations and valued Dyck paths ⋮ Existence of u -Representation of Graphs ⋮ Tests and Proofs for Enumerative Combinatorics ⋮ Representing Permutations with Few Moves ⋮ Structure of random 312-avoiding permutations ⋮ Rollercoasters: Long Sequences without Short Runs ⋮ On partially ordered patterns of length 4 and 5 in permutations ⋮ The operators \(F_i\) on permutations, 132-avoiding permutations and inversions ⋮ Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations ⋮ 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 ⋮ Recurrence relations in counting the pattern 13-2 in flattened permutations ⋮ Mahonian STAT on rearrangement class of words ⋮ Permutations, Moments, Measures ⋮ Avoidance of classical patterns by Catalan sequences ⋮ Frame patterns in \(n\)-cycles ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ \((a, b)\)-rectangle patterns in permutations and words ⋮ Further enumeration results concerning a recent equivalence of restricted inversion sequences ⋮ Counting subword patterns in permutations arising as flattened partitions of sets ⋮ On the topology of the permutation pattern poset ⋮ Pattern restricted quasi-Stirling permutations ⋮ UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS ⋮ Counting subwords in flattened partitions of sets ⋮ Stack-sorting for Words
This page was built for publication: Patterns in permutations and words.
