z-logo
open-access-imgOpen Access
Set partitions with successions and separations
Author(s) -
Augustine O. Munagi
Publication year - 2005
Publication title -
international journal of mathematics and mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 39
eISSN - 1687-0425
pISSN - 0161-1712
DOI - 10.1155/ijmms.2005.451
Subject(s) - algorithm , computer science
Partitions of the set {1,2,…,n} are classified as having successions if a block contains consecutive integers, and separated otherwise. This paper constructs enumeration formulas for such set partitions and some variations using Stirling numbers of the second kind

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom