A property of alternating groups

dc.creatorCejtin, Henry
dc.creatorRivin, Igor
dc.date2003-03-04
dc.date2003-03-18
dc.date.accessioned2026-07-07T04:55:44Z
dc.date.available2026-07-07T04:55:44Z
dc.descriptionWe describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that every element of A_n is a commutator in the symmetric group S_n.
dc.identifierhttps://arxiv.org/abs/math/0303036
dc.identifierhttp://arxiv.org/abs/math/0303036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66685
dc.subjectGroup Theory
dc.subject20B35; 20B40
dc.titleA property of alternating groups
dc.typetext

Files

Collections