Enumerating set partitions by the number of positions between adjacent occurrences of a letter
From MaRDI portal
Publication:5412646
DOI10.2298/AADM100425019MzbMath1299.05021OpenAlexW1971124953MaRDI QIDQ5412646
Toufik Mansour, Mark Shattuck, Stephan G. Wagner
Publication date: 25 April 2014
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm100425019m
Related Items (3)
Two by two squares in set partitions ⋮ Elements protected by records in set partitions ⋮ Counting visible levels in bargraphs and set partitions
This page was built for publication: Enumerating set partitions by the number of positions between adjacent occurrences of a letter