|
Organizers |
Counting Permutations by their Rigid Patterns
by
Amy Myers
Department of Mathematics, University of Pennsylvania
In how many n-permutations does a given pattern occur exactly m times? In most cases, the answer is unknown. When we search for rigid patterns, on the other hand, we obtain an exact formula for the solution, in all cases considered.
Date received: May 10, 2001
Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # cags-81.