Abstract
Prompted by a question of Jim Propp, this paper examines the cyclic sieving phenomenon (CSP) in certain cyclic codes. For example, it is shown that, among dual Hamming codes over Fq, the generating function for codedwords according to the major index statistic (resp. the inversion statistic) gives rise to a CSP when q=2 or q=3 (resp. when q=2). A byproduct is a curious characterization of the irreducible polynomials in F2[x] and F3[x] that are primitive.
| Original language | English (US) |
|---|---|
| Article number | 101846 |
| Journal | Finite Fields and their Applications |
| Volume | 73 |
| DOIs | |
| State | Published - Aug 2021 |
Bibliographical note
Publisher Copyright:© 2021 Elsevier Inc.
Keywords
- Cyclic codes
- Cyclic sieving
- Descent number
- Inversion number
- Mahonian statistics
- Major index
- Polynomials
Fingerprint
Dive into the research topics of 'Cyclic Sieving for cyclic codes'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS