Enumeration of 3-letter patterns in compositions
S. Heubach, T. Mansour
Abstract
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.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.