Abstract
We give a general lower bound on the rank of matrices of the form ρ(h)−I with ρ:G→GL(Fn) an irreducible representation of a finite group G. The main tool in the proof is a (strengthening) of a reduction due to Efremenko from low rank matrices spanned by a few images of ρ to Locally Decodable Codes (LDCs), which are a special kind of error correcting codes. We then apply the known results on 2-query LDCs to derive our rank bound.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-14 |
| Number of pages | 14 |
| Journal | Linear Algebra and Its Applications |
| Volume | 748 |
| DOIs | |
| State | Published - Nov 1 2026 |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics
Keywords
- Error correcting codes
- Finite groups
- Representations
Fingerprint
Dive into the research topics of 'Rank-metric separation in irreducible representations of finite groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver