✦ LIBER ✦

Generalization of the problem of the number of partitions of a finite set

✍ Scribed by B. I. Selivanov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1971
Tongue: English
Weight: 291 KB
Volume: 10
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01464728

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitions of the set of finite sequence

Partitions of the set of finite sequences

✍ María Carrasco; Carlos Augusto Di Prisco; Andrés Millán 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 685 KB

Solution of a generalized problem of par

Solution of a generalized problem of partitioning of sets

✍ S. B. Katsev 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 741 KB

A generalization of the weighted set cov

A generalization of the weighted set covering problem

✍ Jian Yang; Joseph Y-T. Leung 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,

On the number of partition patterns of a

On the number of partition patterns of a set

✍ N.G. de Bruijn 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 228 KB

On the number of distinct block sizes in

On the number of distinct block sizes in partitions of a set

✍ A.M Odlyzko; L.B Richmond 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Partition of a plane set into a finite n

Partition of a plane set into a finite number of d-convex parts

✍ V. P. Soltan 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 474 KB