A note on similarity relations
โ Scribed by Volker Strehl
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 287 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
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 Jequence.
๐ SIMILAR VOLUMES
Many activities in business process management, such as process retrieval, process mining, and process integration, need to determine the similarity or the distance between two processes. Although several approaches have recently been proposed to measure the similarity between business processes, ne