The covering radius of PGL₂(q)

2017/02/15 by Binzhou Xia, Xia, Binzhou
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1702.04559

openalex publication_date 2017/02/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The covering radius of a subset C of the symmetric group S_n is the maximal Hamming distance of an element of S_n from C. This note determines the covering radii of the finite projective general linear groups. It turns out that the covering radius of PGL₂(q) is q-2 if q is even, and is q-3 if q is odd.

Related

• Covering Radius of Permutation Groups with Infinity-Norm
• An improved upper bound on the covering radius of the logarithmic lattice of ℚ(ζ_n)
• The covering radii of the 2-transitive unitary, Suzuki, and Ree groups
• Covering radius of RM(4,8)
• The covering radius of permutation designs