✦ LIBER ✦

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

✍ Scribed by A.M Odlyzko; L.B Richmond

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 393 KB
Volume: 38
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90066-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of distinct part sizes in a r

The number of distinct part sizes in a random integer partition

✍ William M.Y Goh; Eric Schmutz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Average Number of Distinct Part Sizes in

Average Number of Distinct Part Sizes in a Random Carlitz Composition

✍ William M.Y. Goh; Paweł Hitczenko 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 93 KB

On the number of distinct minimal clique

On the number of distinct minimal clique partitions and clique covers of a line graph

✍ Sean McGuinness; Rolf Rees 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

Limiting Distributions for the Number of

Limiting Distributions for the Number of Distinct Component Sizes in Relational Structures

✍ Ljuben Mutafchiev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 428 KB

We investigate from probabilistic point of view the asymptotic behavior of the number of distinct component sizes in general classes of combinatorial structures of size n as n Ä . Mild restrictions of admissibility type are imposed on the corresponding generating functions and asymptotic expressions

A small generating set for the 3-BD clos

A small generating set for the 3-BD closed set of block sizes ≥ 6

✍ Shaopu Zhang; Jianguo Lei; Hairong Kong 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

Let v, k be positive integers and k ≥ 3, then K k = {v : v ≥ k} is a 3-BD closed set. Two finite generating sets of 3-BD closed sets K 4 and K 5 are obtained by H. Hanani [5] and Qiurong Wu [12] respectively. In this article we show that if v ≥ 6, then v ∈ B 3 (K, 1), where K = {6, 7, . . . , 41, 45

On the Size of a Double Blocking Set inP

On the Size of a Double Blocking Set inPG(2,q)

✍ Simeon Ball; Aart Blokhuis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 212 KB

We obtain lower bounds for the size of a double blocking set in the Desarguesian projective plane PG(2, q). These bounds are best possible for q Ͻ 11 and in the case q is a square. With the same technique we also exclude certain values for the size of an ordinary minimal blocking set.