[Date Index] [Thread Index] [Author Index]

All involutions of a permutation

• To: mathgroup at smc.vnet.net
• Subject: [mg7336] All involutions of a permutation
• From: Wouter Meeussen Vandemoortele CC R&D <w.meeussen.vdmcc at vandemoortele.be>
• Date: Tue, 27 May 1997 22:27:13 -0400 (EDT)
• Sender: owner-wri-mathgroup at wolfram.com

bored?

then, for what it's worth, 

i built me a function that takes any permutation p as argument, and spews
out a list of "involutions" or decompositions (permutations q :
q^2==Identity, so that q r == p with r^2==Identity). Although the math is
simple (once you get the knack), the programming in Mathematica turned out
harder than 1 would guess.


A much simpler function counts the number of involutions for each permutation p.


Anyone who begs & screams long enough might (just might) get a copy. (;-)#


wouter.

NV Vandemoortele Coordination Center
Group R&D Center
Prins Albertlaan 79
Postbus 40
B-8870 Izegem (Belgium)
Tel: +/32/51/33 21 11
Fax: +/32/51/33 21 75
vdmcc at vandemoortele.be