2000 character limit reached
On Number of Compositions of Natural Numbers
Published 22 Apr 2010 in math.CO | (1004.3970v1)
Abstract: We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural number in which a certain number of parts are p-1, and other parts are not less than p with compositions in which all parts are not less than p. Then we find a relationship between principal minors of a type of Hessenberg matrices and compositions of natural numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
