Page 279
2. The notion of a chapter-generation, 3. Frequency damping principle
Page 280
4. The metod of finding the chronologically correct order
Page 281
Page 282
5. The Method of duplicate recognition
Page 283
6. Nemerical experiments
Page 284
Page 285
7. Modification of the frequency damping principle, 8. Histogram f1in the case of the list X without duplicates
Page 286
8. Distribution of
Page 287
10. Numerical experiments with real lists
Page 288
11. The card desk problem
Page 289
12. Relation of a pair names
Page 290
Page 291
13. Relation of two neighbourhoods in the list
Page 292
14. The relation matrix
Page 293
Page 294
15. The results of numerical analysis
Page 295
Page 296
16. Main results, 17. The tables
Page 297
Page 298
Page 299
Table 8, Table 9, Table 10, References
Page 300
Resume
Page 301
