Partially ordered generalized patterns and k-ary words
From MaRDI portal
Partially ordered generalized patterns and \(k\)-ary words
Abstract: Recently, Kitaev [Ki2] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by Babson and Steingr'imsson [BS]. A POGP p is a GP some of whose letters are incomparable. In this paper, we study the generating functions (g.f.) for the number of k-ary words avoiding some POGPs. We give analogues, extend and generalize several known results, as well as get some new results. In particular, we give the g.f. for the entire distribution of the maximum number of non-overlapping occurrences of a pattern p with no hyphens (that allowed to have repetition of letters), provided we know the g.f. for the number of k-ary words that avoid p.
Recommendations
- Patterns in words of ordered set partitions
- Counting Ordered Patterns in Words Generated by Morphisms
- Counting ordered patterns in words generated by morphisms
- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations
- Pattern avoidance in ordered set partitions and words
- Partially ordered patterns and their combinatorial interpretations
- Partially ordered generalized patterns
- Generalized Jacobsthal numbers and restricted k-ary words
- On universal partial words for word-patterns and set partitions
- Codes, orderings, and partial words
Cited in
(18)- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations
- On partially ordered patterns of length 4 and 5 in permutations
- Patterns in words of ordered set partitions
- Partially ordered generalized patterns
- Partially ordered patterns and their combinatorial interpretations
- scientific article; zbMATH DE number 5870280 (Why is no real title available?)
- C-sortable words as green mutation sequences
- Wilf equivalence for generalized factor orders modulo \(k\)
- Generalized Jacobsthal numbers and restricted k-ary words
- On permutation patterns with constrained gap sizes
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- Ranking and Unranking k-Subsequence Universal Words
- Generating functions for permutations avoiding a consecutive pattern
- Proof of a conjecture on the shape-Wilf-equivalence for partially ordered patterns
- Ordinal and disjoint sums of partially ordered patterns
- Segmental partially ordered generalized patterns
- Permutations and words counted by consecutive patterns
- Introduction to partially ordered patterns
This page was built for publication: Partially ordered generalized patterns and \(k\)-ary words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407499)