An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set

Details An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set

2010-06-21

arxiv.org/abs/1006.3993v1

Computer Science

Data Structures and Algorithms

Scientific paper

An involution on a finite set is a bijection such as I(I(e))=e for all the element of the set. A fixed-point free involution on a finite set is an involution such as I(e)=e for none element of the set. In this article, the fixed-point free involutions are represented as partitions of the set and some properties linked to this representation are exhibited. Then an optimal algorithm to list all the fixed-point free involutions is presented. Its soundness relies on the representation of the fixed-point free involutions as partitions. Finally, an implementation of the algorithm is proposed, with an effective data representation.

Affiliated with

Also associated with

No associations

Rating

An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-600598