On the cardinality of a factor set in the symmetric group

From MaRDI portal
Publication:2920902

DOI10.1142/S1793557114500272zbMATH Open1298.05035arXiv1410.8408OpenAlexW3099230395MaRDI QIDQ2920902FDOQ2920902


Authors: Krasimir Yordzhev Edit this on Wikidata


Publication date: 29 September 2014

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1410.8408




Recommendations




Cites Work


Cited In (2)





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)