Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Rational permutation groups containing a full cycle

In: Mathematica Slovaca, vol. 63, no. 6
Temha Erkoç - Utku Yilmaztürk

Details:

Year, pages: 2013, 1227 - 1232
Keywords:
rational groups, permutation groups
About article:
A finite group whose irreducible complex characters are rational valued is called a rational group. Thus, $G$ is a rational group if and only if $NG(\langle x\rangle)/CG(\langle x\rangle)\cong Aut(\langle x\rangle )$ for every $x\in G$. For example, all symmetric groups and their Sylow $2$-subgroups are rational groups. Structure of rational groups have been studied extensively, but the general classification of rational groups has not been able to be done up to now. In this paper, we show that a full symmetric group of prime degree does not have any rational transitive proper subgroup and that a rational doubly transitive permutation group containing a full cycle is the full symmetric group. We also obtain several results related to the study of rational groups.
How to cite:
ISO 690:
Erkoç, T., Yilmaztürk, U. 2013. Rational permutation groups containing a full cycle. In Mathematica Slovaca, vol. 63, no.6, pp. 1227-1232. 0139-9918. DOI: https://doi.org/10.2478/s12175-013-0167-5

APA:
Erkoç, T., Yilmaztürk, U. (2013). Rational permutation groups containing a full cycle. Mathematica Slovaca, 63(6), 1227-1232. 0139-9918. DOI: https://doi.org/10.2478/s12175-013-0167-5
About edition: