✦ LIBER ✦

On Sets Represented by Partitions

✍ Scribed by Jean-Christophe Aval

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 58 KB
Volume: 20
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1999.0300

No coin nor oath required. For personal study only.

✦ Synopsis

We prove a lemma that is useful for obtaining upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts) partitions of an integer n.

📜 SIMILAR VOLUMES

A note on finding compact sets in graphs

A note on finding compact sets in graphs represented by an adjacency list

✍ Sung Kwon Kim 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 371 KB

On partitions of a partially ordered set

✍ A.J Hoffman; D.E Schwartz 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 451 KB

On partitioning integers into progressio

On partitioning integers into progression free sets

✍ H.L Abbott; A.C Liu 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Geometrical Transformations on pictures

Geometrical Transformations on pictures represented by leafcodes

✍ Marloes L.P van Lierop 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 96 KB

Set partition by globally optimized clus

Set partition by globally optimized cluster seed points

✍ János Pintér; Géza Pesti 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 703 KB

On abab-free and abba-free Set Partition

On abab-free and abba-free Set Partitions

✍ Martin Klazar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 341 KB

These are partitions of [ l ] ϭ ͕ 1 , 2 , . . . , l ͖ into n blocks such that no four-term subsequence of [ l ] induces the mentioned pattern and each k consecutive numbers of [ l ] fall into dif ferent blocks . These structures are motivated by Davenport -Schinzel sequences . We summarize and exten