On the cardinality of a factor set in the symmetric group

From MaRDI portal
Publication:2920902




Abstract: Let n be a positive integer, sigma be an element of the symmetric group mathcalSn and let sigma be a cycle of length n. The elements are sigma-equivalent, if there are natural numbers k and l, such that , which is the same as the condition to exist natural numbers k1 and l1, such that . In this work we examine some properties of the so defined equivalence relation. We build a finite oriented graph Gamman with the help of which is described an algorithm for solving the combinatorial problem for finding the number of equivalence classes according to this relation.









This page was built for publication: On the cardinality of a factor set in the symmetric group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920902)