Some Applications of S-restricted Set Partitions
classification
🧮 math.CO
keywords
applicationspartitionsauthorsblockcombinatorialcontainedcountsfinite
read the original abstract
In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of the main applications is in the study of lonesum matrices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.