Cyclically covering subspaces in \(\mathbb{F}_2^n\)

DOI10.1016/j.jcta.2021.105436zbMath1462.05056arXiv1903.10613OpenAlexW3130256170MaRDI QIDQ2019622

Tom Johnston, Carla Groenland, James Aaronson

Publication date: 21 April 2021

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.10613

zbMATH Keywords

cyclic shiftcyclically covering subspacesIsbell's conjecturesmallest codimension

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Vector spaces, linear dependence, rank, lineability (15A03) Combinatorial aspects of packing and covering (05B40) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• Unnamed Item
• Large sets with small doubling modulo \(p\) are well covered by an arithmetic progression
• Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012
• Smallest cyclically covering subspaces of \(\mathbb{F}_q^n\), and lower bounds in Isbell's conjecture
• Intersecting families of finite sets and fixed-point-free 2-elements
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• An inverse theorem mod p
• On Artin's conjecture.
• Research problems

This page was built for publication: Cyclically covering subspaces in \(\mathbb{F}_2^n\)