31 Jul
2016
31 Jul
'16
9:41 a.m.
* James Propp <jamespropp@gmail.com> [Jul 30. 2016 13:56]:
Tom,
[...]
31 factorial is really large; it could be a very long night... :-)
One could mod out by a couple of dihedral group actions (one is geometric, based on the cyclic ordering of the n points, the other is combinatorial, based on the order in which the tour visits the points), but it's tricky because if I'm not mistaken they act "from opposite sides" (I never learned to like double cosets), and anyway, 31 factorial divided by 62 squared is still enormous...
The cyclic part is easy, just fix the first element, that divides by n. For the other part I speculate that keeping the relative order of two other elements fixed would take care of it. Best regards, jj
[...]