Counting Specific Classes of Relations Regarding Fixed Points and Reflexive Points
This is a combinatorial enumeration problem for mathematicians studying relations on finite sets, but the results are incremental and lack clear application.
The paper counts specific classes of relations (functions, partial functions, total relations, general relations, permutations, involutions, idempotent functions) on a finite set regarding fixed points and reflexive points, calculates probabilities and limiting values as set size grows. No concrete numbers are provided in the abstract.
Given a finite and non-empty set $X$ and randomly selected specific functions and relations on $X$, we investigate the existence and non-existence of fixed points and reflexive points, respectively. First, we consider the class of functions, weaken it to the classes of partial functions, total relations and general relations and also strengthen it to the class of permutations. Then we investigate the class of involutions and the subclass of proper involutions. Finally, we treat idempotent functions, partial idempotent functions and related concepts. We count relations, calculate corresponding probabilities and also calculate the limiting values of the latter in case that the cardinality of $X$ tends to infinity. All these results have been motivated and also supported by numerous experiments performed with the RelView tool.