Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tiling symmetric groups by transpositions

Published 31 May 2025 in math.CO and math.RT | (2506.00360v1)

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

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.