Smooth partitions and Chebyshev polynomials

DOI10.1112/BLMS/BDP071MaRDI QIDQ5852008zbMATH OpenOpenAlexFDO

Authors Toufik Mansour

Publication date 26 January 2010

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/blms/bdp071

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Combinatorics in computer science (68R05)

Recommendations

• Counting peaks and valleys in a partition of a set
• Smooth compositions and smooth words
• Restricted permutations and Chebyshev polynomials
• Partitions of a set satisfying certain set of conditions
• Compositions and Chebyshev polynomials

Cited in

(5)

• Staircase patterns in words: subsequences, subwords, and separation number
• Smooth column convex polyominoes
• Counting peaks and valleys in a partition of a set
• Enumeration of r-smooth words over a finite alphabet
• Enumeration of smooth inversion sequences and proof of a recent related conjecture

This page was built for publication: Smooth partitions and Chebyshev polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5852008)