Enumeration of 3-letter patterns in compositions

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages, 1 figure; accepted for the Proceedings of the 2005 Integer Conference

Scientific paper

Let A be any set of positive integers and n a positive integer. A composition of n with parts in A is an ordered collection of one or more elements in A whose sum is n. We derive generating functions for the number of compositions of n with m parts in A that have r occurrences of 3-letter patterns formed by two (adjacent) instances of levels, rises and drops. We also derive asymptotics for the number of compositions of n that avoid a given pattern. Finally, we obtain the generating function for the number of k-ary words of length m which contain a prescribed number of occurrences of a given pattern as a special case of our results.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Enumeration of 3-letter patterns in compositions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of 3-letter patterns in compositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of 3-letter patterns in compositions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-69585

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.