Smallest cyclically covering subspaces of Fqn, and lower bounds in Isbell's conjecture

Peter J. Cameron, David Ellis, William Raynaud

Research output: Contribution to journalArticlepeer-review

Abstract

For a prime power q and a positive integer n, we say a subspace U of Fqn is cyclically covering if the union of the cyclic shifts of U is equal to Fqn. We investigate the problem of determining the minimum possible dimension of a cyclically covering subspace of Fqn. (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.
Original languageEnglish
Pages (from-to)242-255
JournalEuropean Journal of Combinatorics
Volume81
Early online date20 Jun 2019
DOIs
Publication statusPublished - Oct 2019

Fingerprint

Dive into the research topics of 'Smallest cyclically covering subspaces of Fqn, and lower bounds in Isbell's conjecture'. Together they form a unique fingerprint.

Cite this