A new proof from the Australian science fiction writer Greg Egan and a 2011 proof anonymously posted online are now being hailed as significant advances on a puzzle mathematicians have been studying ...
Abstract: It is known that, when n is even, the number of permutations of {1,2,...,n} all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Hegedüs ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results