English

On perfect order subsets in finite groups

Group Theory 2019-02-22 v2

Abstract

If GG is a finite group and xGx\in G then the set of all elements of GG having the same order as xx is called {\em an order subset of GG determined by xx} (see [2]). We say that GG is a {\em group with perfect order subsets} or briefly, GG is a {\em POSPOS-group} if the number of elements in each order subset of GG is a divisor of G|G|. In this paper we prove that for any n4n\geq 4, the symmetric group SnS_n is not POSPOS-group. This gives the positive answer to one of two questions rising from Conjecture 5.2 in [3].

Keywords

Cite

@article{arxiv.1007.0568,
  title  = {On perfect order subsets in finite groups},
  author = {Nguyen Trong Tuan and Bui Xuan Hai},
  journal= {arXiv preprint arXiv:1007.0568},
  year   = {2019}
}

Comments

8 pages

R2 v1 2026-06-21T15:44:16.599Z