On perfect order subsets in finite groups.
From MaRDI portal
Abstract: If is a finite group and then the set of all elements of having the same order as is called {em an order subset of determined by } (see [2]). We say that is a {em group with perfect order subsets} or briefly, is a {em -group} if the number of elements in each order subset of is a divisor of . In this paper we prove that for any , the symmetric group is not -group. This gives the positive answer to one of two questions rising from Conjecture 5.2 in [3].
Recommendations
Cited in
(8)- The perfect order subset conjecture for simple groups.
- On finite groups having perfect order subsets.
- On groups with perfect order subsets
- Hereditary Perfect Order Subset Groups
- On three questions concerning groups with perfect order subsets.
- On the (non-)contractibility of the order complex of the coset poset of an alternating group.
- A note on finite groups having perfect order subsets.
- An improvement on the perfect order subsets of finite groups
This page was built for publication: On perfect order subsets in finite groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009723)