
arXiv: math/0104098
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the patterns 1, l, l-1, ..., 2. We show that, except for the patterns 1, 2 and 2, 1 where the sequence is well-known to be log concave, there are infinitely many n where the sequence has internal zeros.
24 pages
Permutations, words, matrices, 05A05 (Primary) 05A20, 05E99, 06A07 (Secondary), permutations, Applied Mathematics, Exact enumeration problems, generating functions, FOS: Mathematics, Mathematics - Combinatorics, patterns, Combinatorics (math.CO)
Permutations, words, matrices, 05A05 (Primary) 05A20, 05E99, 06A07 (Secondary), permutations, Applied Mathematics, Exact enumeration problems, generating functions, FOS: Mathematics, Mathematics - Combinatorics, patterns, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
