Tiling the symmetric group by transpositions

Abstract

For nonempty subsets X and Y of a group G, we say that (X,Y) is a tiling of G if every element of G can be uniquely expressed as xy for some x∈ X and y∈ Y. In 1966, Rothaus and Thompson studied whether the symmetric group Sn with n≥3 admits a tiling (Tn,Y), where Tn consists of the identity and all the transpositions in Sn. They showed that no such tiling exists if 1+n(n-1)/2 is divisible by a prime number at least n+2. In this paper, we establish a new necessary condition for the existence of such a tiling: the subset Y must be partition-transitive with respect to certain partitions of n. This generalizes the result of Rothaus and Thompson, as well as a result of Nomura in 1985. We also study whether Sn can be tiled by the set Tn* of all the transpositions, which finally leads us to conjecture that neither Tn nor Tn* tiles Sn for any n≥4.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…