A simple proof is given for the fact that the number of nonsingular similarity relations on (1,2,... n), for which the transitive closure consists of k blocks, equals ("\*;'\_i-') -(2"-fh -'), 1, =G k s n/2. In particular, this implies a recent result of Shapiro about Catalan numbers and Fine's Jequ
A note on the similarity depth
โ Scribed by G. Rozenberg; R. Verraedt
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 220 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The so-called universal sequence that was discovered by Metropolis, [4], exhibits self-organization and self-similarity when its sequence of LR-patterns is translated into numerical values and depicted in a two-dimensional phase-portrait. This paper shows how this self-organization arises.
This note presents a measure of similarity between connected nodes in terms of centrality based on Euclidean distances, and compares it to 'assortative mixing' [Newman, M.E.J., 2002. Assortative mixing in networks. Physical Review Letters 89, 208701], which is based on Pearson correlation coefficien