Tag Archives: derangements

Finding derangements without CFSG

Nearly two years ago, I posed the problem of finding an “elementary” deterministic polynomial-time algorithm for finding a fixed-point-free element (or derangement) in a transitive permutation group. The background is that there are so many fpf elements (at least a … Continue reading

Posted in exposition | Tagged , , | Leave a comment

Pretty structures

I was at the Pretty Structures conference in Paris last week. The original conference in what became this sequence was called Pretty Things. Perhaps this is not serious enough for a meeting held at the Institut Henri Poincaré, I don’t … Continue reading

Posted in events, exposition | Tagged , , , , , , | 2 Comments