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
Publication date: 29 September 2014
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Abstract: Let be a positive integer, be an element of the symmetric group and let be a cycle of length . The elements are -equivalent, if there are natural numbers and , such that , which is the same as the condition to exist natural numbers and , such that . In this work we examine some properties of the so defined equivalence relation. We build a finite oriented graph 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
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Partitions of sets (05A18) Symmetric groups (20B30)
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)