Covering finite fields by translates of multiplicative subgroups
Abstract
Let Gd be the subgroup of index d>1 in 𝔽q×, and put Gd0=Gd∪{0}. For a covering A+Gd0=𝔽q with #A=s, we prove q≤ d8s/d by shifting the roots of a Bonferroni polynomial. Although a uniform bound in s alone must allow exponential growth, our estimate confines such growth to bounded indices and gives polynomial bounds when s/d is bounded. A cubic specialization gives bounds of degree at most eight for s≤2d. For shift sets of logarithmic size, higher moment estimates give a uniform covering-probability formula, including the critical window. Together with the index restriction, this determines the covering indices of almost every shift set of size ⌈ klog q⌉ for each fixed integer k≥2. A subfield construction attains the order of the uniform restriction on the index. We determine its covering number exactly and prove minimality under subgroup inclusion. We also characterize equality in the elementary counting bound by subfield cosets. Fixing a subfield as the shift set in a quadratic extension leads to a sharper projection bound, attained by an infinite family with unique representations outside the shift subfield.
Related
- Covering plane curves over finite fields with lines
- Finite subgroups of outer automorphism groups of the absolute Galois groups of mixed-characteristic local fields
- Multiplicative subgroups are not restricted sumsets
- Additive decompositions of multiplicative subgroups via differential identities
- Decay of weighted cusp counts for congruence subgroups of SL2 over number fields
BibTeX
@misc{zhou2026covering,
title = {{Covering finite fields by translates of multiplicative subgroups}},
author = {Juncheng Zhou and Hongfeng Wu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.25228},
eprint = {2610.25228},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.25228},
}
RIS
TY - UNPB
TI - Covering finite fields by translates of multiplicative subgroups
AU - Juncheng Zhou
AU - Hongfeng Wu
PY - 2026
DA - 2026/10/18
PB - arXiv
DO - 10.48550/arxiv.2610.25228
UR - https://arxiv.org/abs/2610.25228
AB - Let G_d be the subgroup of index d>1 in 𝔽_q^×, and put G_d^0=G_d∪{0}. For a covering A+G_d^0=𝔽_q with #A=s, we prove q≤ d^8s/d by shifting the roots of a Bonferroni polynomial. Although a uniform bound in s alone must allow exponential growth, our estimate confines such growth to bounded indices and gives polynomial bounds when s/d is bounded. A cubic specialization gives bounds of degree at most eight for s≤2d. For shift sets of logarithmic size, higher moment estimates give a uniform covering-probability formula, including the critical window. Together with the index restriction, this determines the covering indices of almost every shift set of size ⌈ klog q⌉ for each fixed integer k≥2. A subfield construction attains the order of the uniform restriction on the index. We determine its covering number exactly and prove minimality under subgroup inclusion. We also characterize equality in the elementary counting bound by subfield cosets. Fixing a subfield as the shift set in a quadratic extension leads to a sharper projection bound, attained by an infinite family with unique representations outside the shift subfield.
ER -