Home Semi-rational solvable groups
Article
Licensed
Unlicensed Requires Authentication

Semi-rational solvable groups

  • David Chillag and Silvio Dolfi
Published/Copyright: February 8, 2010
Journal of Group Theory
From the journal Volume 13 Issue 4

Abstract

An element x of a finite group G is called rational if all generators of the group 〈x〉 are contained in a single conjugacy class. If all elements of G are rational, then G itself is called rational. It was proved by Gow that if G is a rational solvable group then π(G) ⊂ {2, 3, 5}. We call xG semi-rational if all generators of 〈x〉 are contained in a union of two conjugacy classes. Furthermore, we call xG inverse semi-rational if every generator of 〈x〉 is conjugate to either x or x–1. Then G is called semi-rational (resp. inverse semi-rational) if all elements of G are semi-rational (resp. inverse semi-rational). We show that if G is semi-rational and solvable then π(G) ⊂ {2, 3, 5, 7, 13, 17}, and if G is inverse semi-rational and solvable then 17 ∉ π(G). If G has odd order, then it is semi-rational if and only if it is inverse semi-rational. In this case we describe the structure of G.

Received: 2009-05-18
Revised: 2009-09-23
Published Online: 2010-02-08
Published in Print: 2010-July

© de Gruyter 2010

Downloaded on 27.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jgt.2010.004/html
Scroll to top button