Sciweavers

CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 16 days ago
An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set
A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
Cyril Prissette