In continuation of the previous talk on transfer systems by Koki Shibata, we explore the width of non-abelian transfer systems. A transfer system of G is said to be complete if it contains all possible arrows. The width of a G-Transfer System, defined in 2025 by Adamyk, Balchin, Barrero, Scheirer, Wisdom, and Zapata Castro is the number of relations needed to force a G-transfer system to be complete. We explore how the width is related to the prime factorization of the order of the group. In this talk, we present a proof that the width of is Cpnqmis n +m. Further, we show the width of D2nis 5 and the width of DP1ɑ1P2ɑ2...Pnɑn is equal to the number of maximal subgroups.
