arXiv · 2611.21894
Permutation groups, derangements and connections
Abstract
What is the chance that a random shuffling of a deck of cards leaves no card in its original place? More precisely, what is the chance that a random permutation has no fixed points? A permutation with no fixed points is known as a derangement. Questions about derangements, like the ones above, go back centuries, but there are also several unsolved problems in this very active area of permutation group theory. Based on a minicourse given at "Groups and Algebras in Bicocca for Young Algebraists" in June 2026, this survey provides a general introduction to permutation group theory, with a specific focus on derangements. The survey features modern methods for studying permutation groups, recent developments and open problems concerning derangements and connections between this topic and other areas, such as combinatorics, graph theory, number theory, representation theory and topology.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Scott Harper. 2026-11-16. Permutation groups, derangements and connections. https://searcharxiv.com/abs/2611.21894
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.