Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 12 min ago
PreprintarXiv licencearXiv

Two-Sided Dimension Bounds for the Peterson Hit Problem via Projections and Matrix Minors

Abstract

Let 𝒫k=𝔽2[x1,…,xk] be the polynomial algebra over the prime field 𝔽2, viewed as an unstable module over the mod-$2$ Steenrod algebra π’œ. The well-known Peterson hit problem asks for a minimal set of generators for the π’œ-module 𝒫k. This is equivalent to determining the dimension of the cohit space (Q𝒫k)d=(𝒫k/π’œ+𝒫k)d, where π’œ+ denotes the augmentation ideal of π’œ, for every kβ‰₯1 and positive degree d. Although solved in every degree for at most four variables, it remains a difficult open problem in general. Furthermore, given the limitations of current tools, explicitly determining the dimension of (Q𝒫k)d in the general case appears out of reach. Motivated by these limitations, we establish explicit upper and lower bounds for this dimension for arbitrary positive integers k and d. Our method combines binary combinatorics, linear algebra, and graph and simplicial structures associated with the generating Steenrod squares. We characterize zero rows, count zero columns, and refine rank estimates using Adem relations. Minors and zero rows of the resulting smaller matrix yield further two-sided cohit bounds without determining a complete basis or computing the full hit rank.

Related

  1. Improved dimension bounds for Falconer's distance problem in the plane
    Alex Iosevich, Alexia Yavicoli
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. Ergodic Γ— p-invariant measures on 𝕋2 with no dimension dropping projections
    Amir Algom
    arXivPreprintarXiv licenceFull textAnalysis & PDEsDynamical systemsarXiv
  3. Orthogonal Projections and Assouad Dimension: Resolving Fraser's Questions
    Bilel Selmi
    arXivPreprintCC BY 4.0Full textDynamical systemsarXiv
  4. Absolute continuity of projections and dimension conservation for self-similar sets and measures
    Xiong Jin, Tuomas Sahlsten
    arXivPreprintarXiv licenceFull textAnalysis & PDEsDynamical systemsarXiv
  5. Quantum expanders and dimension-free commutator bounds
    Tuan Tran
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
BibTeX
@misc{phuc2026twosided,
  title = {{Two-Sided Dimension Bounds for the Peterson Hit Problem via Projections and Matrix Minors}},
  author = {Dang Vo Phuc and Peter V. Danchev},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2608.02623},
  eprint = {2608.02623},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.02623},
}
RIS
TY  - UNPB
TI  - Two-Sided Dimension Bounds for the Peterson Hit Problem via Projections and Matrix Minors
AU  - Dang Vo Phuc
AU  - Peter V. Danchev
PY  - 2026
DA  - 2026/10/20
PB  - arXiv
DO  - 10.48550/arxiv.2608.02623
UR  - https://arxiv.org/abs/2608.02623
AB  - Let 𝒫_k=𝔽_2[x_1,…,x_k] be the polynomial algebra over the prime field 𝔽_2, viewed as an unstable module over the mod-$2$ Steenrod algebra π’œ. The well-known Peterson hit problem asks for a minimal set of generators for the π’œ-module 𝒫_k. This is equivalent to determining the dimension of the cohit space (Q𝒫_k)_d=(𝒫_k/π’œ^+𝒫_k)_d, where π’œ^+ denotes the augmentation ideal of π’œ, for every kβ‰₯1 and positive degree d. Although solved in every degree for at most four variables, it remains a difficult open problem in general. Furthermore, given the limitations of current tools, explicitly determining the dimension of (Q𝒫_k)_d in the general case appears out of reach. Motivated by these limitations, we establish explicit upper and lower bounds for this dimension for arbitrary positive integers k and d. Our method combines binary combinatorics, linear algebra, and graph and simplicial structures associated with the generating Steenrod squares. We characterize zero rows, count zero columns, and refine rank estimates using Adem relations. Minors and zero rows of the resulting smaller matrix yield further two-sided cohit bounds without determining a complete basis or computing the full hit rank.
ER  -