Smallest cyclically covering subspaces of $\mathbb{F}_q^n$, and lower bounds in Isbell's conjecture
Peter Cameron, David Ellis, William Raynaud

TL;DR
This paper studies the minimal dimension of cyclically covering subspaces in finite fields, providing bounds, exact results for infinitely many cases, and implications for Isbell's conjecture using combinatorics, representation theory, and finite field theory.
Contribution
It offers new bounds and exact solutions for the minimal dimension of cyclically covering subspaces, advancing understanding of Isbell's conjecture and its generalizations.
Findings
Established bounds for cyclically covering subspaces.
Solved the problem for infinitely many n values for each fixed q.
Provided lower bounds relevant to Isbell's conjecture.
Abstract
For a prime power and a positive integer , we say a subspace of is {\em cyclically covering} if the union of the cyclic shifts of is equal to . We investigate the problem of determining the minimum possible dimension of a cyclically covering subspace of . (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 , we answer the question completely for infinitely many values of (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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
