𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of partitions of n without a given subsum (I)

✍ Scribed by P. Erdős; J.L. Nicolas; A. Sárkőzy

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
538 KB
Volume
75
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Permutations Avoiding a
On the Number of Permutations Avoiding a Given Pattern
✍ Noga Alon; Ehud Friedgut 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Let \_ # S k and { # S n be permutations. We say { contains \_ if there exist Stanley and Wilf conjectured that for any \_ # S k there exists a constant c=c(\_) such that F(n, \_) c n for all n. Here we prove the following weaker statement: For every fixed \_ # S k , F(n, \_) c n#\* (n) , where c=c

On the Number of Times a Root off(n,&#xa
On the Number of Times a Root off(n, x)=0 Generates a Field Containing a Given Number Field
✍ Umberto Zannier 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Let f (x, y) be a polynomial with rational coefficients, and let E be a number field. We prove estimates for the number of positive integers n T such that some root : of f (n, y)=0 satisfies E/Q(:). The estimates are uniform with respect to E and, provided E satisfies natural necessary conditions, t

On the number of vertices of given degre
On the number of vertices of given degree in a random graph
✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

On the effect of experimental error on t
On the effect of experimental error on the calculation of the number of stages for a given distillation separation
✍ A.G. Medina; C. McDermott; N. Ashton 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Earlier work on the effect of experimental error is re-examined, certain limitations are brought out and some of the formulae are re-derived. A method of direct evaluation is also presented which overcomes the former limitations, is of universal applicability and involves no greater computational e

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