2019/05/17 by Cecil Andrew Ellard, Ellard, Cecil Andrew · 2 citations
Mathematics · Computer Science · Engineering · #Finite Group Theory Research #Coding theory and cryptography #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1905.07431
We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation group in which any two elements fixing the same number of letters are conjugate.