Startseite Recounting the Number of Rises, Levels, and Descents in Finite Set Partitions
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Recounting the Number of Rises, Levels, and Descents in Finite Set Partitions

  • Mark Shattuck
Veröffentlicht/Copyright: 31. Mai 2010
Veröffentlichen auch Sie bei De Gruyter Brill
Integers
Aus der Zeitschrift Band 10 Heft 2

Abstract

A finite set partition is said to have a descent at i if it has a descent at i in its canonical representation as a restricted growth function (and likewise for level and rise). In this note, we provide direct combinatorial proofs as well as extensions of recent formulas for the total number of rises, levels, and descents in all the partitions of an n-set with a prescribed number of blocks. In addition, we supply direct proofs of formulas for the number of partitions having a fixed number of levels.

Received: 2009-10-12
Accepted: 2009-12-17
Published Online: 2010-05-31
Published in Print: 2010-May

© de Gruyter 2010

Heruntergeladen am 12.9.2025 von https://www.degruyterbrill.com/document/doi/10.1515/integ.2010.013/html
Button zum nach oben scrollen