Packing patterns into words
Preprint
Abstract
We define the packing density on words and find the packing densities of several types of patterns with repeated letters allowed.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Words Restricted by 3-Letter Generalized Multipermutation PatternsAnnals of Combinatorics, 2003
- Counting occurrences of some subword patternsDiscrete Mathematics & Theoretical Computer Science, 2003
- Words Restricted by Patterns with at Most 2 Distinct LettersThe Electronic Journal of Combinatorics, 2002
- Counting occurrences of a pattern of type (1,2) or (2,1) in permutationsAdvances in Applied Mathematics, 2002
- Pattern Frequency Sequences and Internal ZerosAdvances in Applied Mathematics, 2002
- On Packing Densities of PermutationsThe Electronic Journal of Combinatorics, 2002
- Generalized Pattern AvoidanceEuropean Journal of Combinatorics, 2001
- Restricted PermutationsEuropean Journal of Combinatorics, 1985
- Sorting Using Networks of Queues and StacksJournal of the ACM, 1972