Skip to main content
Book ChapterOPEN ACCESS

Set partitions

  • Arndt J
Springer Berlin Heidelberg, (2011), 354-369
DOI: 10.1007/978-3-642-14764-7_17
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A set partition of a set S is a collection of disjoint subsets of S whose union is S. The number of partitions of the set {k}_(k=1)^n is called a Bell number.

Cite

CITATION STYLE

APA

Arndt, J. (2011). Set partitions. In Matters Computational (pp. 354–369). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-14764-7_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free