On factorially balanced sets of words
✍ Scribed by Gwénaël Richomme; Patrice Séébold
- Book ID
- 113927467
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 221 KB
- Volume
- 412
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
CORES L l o y d S . S h a p l e y ## T h e R a n d C o r p o r a t i o n \* \* \*
Suppose that any t members (t 2) of a regular family on an n element set have at least k common elements. It is proved that the largest member of the family has at least k 1Ât n 1&1Ât elements. The same holds for balanced families, which is a generalization of the regularity. The estimate is asympto
Three new characterisations of balanced words are presented. Each of these characterisations is based on the ordering of a shift orbit, either lexicographically or with respect to the norm | • |1 (which counts the number of occurrences of the symbol 1).