Abstract
A unique factorization theory for labelled combinatorial objects is developed and applied to enumerate several families of objects, including certain families of set partitions, permutations, graphs, and collections of subintervals of [1, n]. The theory involves a notion of irreducibility with respect to set partitions and the enumeration formulas that arise result from a generalization of the well-known “exponential formula.”
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
