✦ LIBER ✦

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

✍ Scribed by V. P. Soltan

Publisher: Springer US
Year: 1985
Tongue: English
Weight: 474 KB
Volume: 20
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01072173

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex partitions of a finite lattice

✍ Scott R. Sykes 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 106 KB

The expected number of parts in a partit

The expected number of parts in a partition ofn

✍ I. Kessler; M. Livingston 📂 Article 📅 1976 🏛 Springer Vienna 🌐 English ⚖ 283 KB

Packing of convex sets in the plane with

Packing of convex sets in the plane with a great number of neighbours

✍ P. Gács 📂 Article 📅 1972 🏛 Akadmiai Kiad 🌐 English ⚖ 276 KB

Generalization of the problem of the num

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

✍ B. I. Selivanov 📂 Article 📅 1971 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 291 KB

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

Partitions of the 4-subsets of a 13-set

Partitions of the 4-subsets of a 13-set into disjoint projective planes

✍ Leo G. Chouinard II 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 422 KB

For I G t < k CI u. let S(t, k, u) denote a Steiner system and let Pr, (u) be the set of all k-subsets of theset {i,2,..., u}. We partition PJ 13) into 55 mutually disjoint S(2.4, 13)'s (projective planes). This is the first known example of a complete partition of Pk(u) into disjoint S(t, k, u)'s f