Enumeration of 3-letter patterns in compositions

Details Enumeration of 3-letter patterns in compositions Enumeration of 3-letter patterns in compositions

2006-03-13

arxiv.org/abs/math/0603285v1

Mathematics

Combinatorics

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.

Affiliated with

Also associated with

No associations

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

Comments { 0 }

Profile ID: LFWR-SCP-O-69585