Smallest cyclically covering subspaces of \mathbbF_qⁿ, and lower bounds in Isbell's conjecture

2018/10/08 by Cameron, Peter, Ellis, David, Raynaud, William
#05B40 #05E18 #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1810.03485

Abstract

For a prime power q and a positive integer n, we say a subspace U of \mathbbF_qⁿ is \em cyclically covering if the union of the cyclic shifts of U is equal to \mathbbF_qⁿ. We investigate the problem of determining the minimum possible dimension of a cyclically covering subspace of \mathbbF_qⁿ. (This is a natural generalisation of a problem posed in 1991 by the first author.) We prove several upper and lower bounds, and for each fixed q, we answer the question completely for infinitely many values of n (which take the form of certain geometric series). Our results imply lower bounds for a well-known conjecture of Isbell, and a generalisation theoreof, supplementing lower bounds due to Spiga. We also consider the analogous problem for general representations of groups. We use arguments from combinatorics, representation theory and finite field theory.

Related

• Cyclic codes and cyclically covering subspaces
• Cyclically covering subspaces in \mathbbF₂ⁿ
• Covering of Subspaces by Subspaces
• Number of minimal cyclic codes with given length and dimension
• An improved upper bound on the covering radius of the logarithmic lattice of ℚ(ζ_n)