On the maximum number of distinct factors of a binary string
β Scribed by Jeffrey Shallit
- Publisher
- Springer Japan
- Year
- 1993
- Tongue
- English
- Weight
- 180 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both p P (n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where p P (n) is the number of partitions of n into primes and p(n) is the total num
statistics a b s t r a c t In this paper, we derive the number of binary strings which contain, for a given i k , exactly i k runs of 1's of length k in all possible binary strings of length n, 1 β€ k β€ n. Such a knowledge about the distribution pattern of runs of 1's in binary strings is useful in