English

A matrix criterion and algorithmic approach for the Peterson hit problem: Part I

Algebraic Topology 2025-07-15 v3 Symbolic Computation Geometric Topology Rings and Algebras

Abstract

The Peterson hit problem in algebraic topology is to explicitly determine the dimension of the quotient space QPk=F2APkQ\mathcal P_k = \mathbb F_2\otimes_{\mathcal A}\mathcal P_k in positive degrees, where Pk\mathcal{P}_k denotes the polynomial algebra in kk variables over the field F2\mathbb{F}_2, considered as an unstable module over the Steenrod algebra A\mathcal{A}. Current approaches to this problem still rely heavily on manual computations, which are highly prone to errors due to the intricate nature of the underlying calculations. To date, no efficient algorithm implemented in any computer algebra system has been made publicly available to tackle this problem in a systematic manner. Motivated by the above, in this work, which is considered as Part I of our project, we first establish a criterion based entirely on linear algebra for determining whether a given homogeneous polynomial is "hit". Accordingly, we describe the dimensions of the hit spaces. This leads to a practical and reliable computational method for determining the dimension of QPkQ\mathcal{P}_k for arbitrary kk and any positive degrees, with the support of a computer algebra system. We then give a concrete implementation of the obtained results as novel algorithms in \textsc{SageMath}. As an application, our algorithm demonstrates that the manually computed result presented in the recent work of Sum and Tai [15] for the dimension of QP5Q\mathcal{P}_5 in degree 262^{6} is not correct. Furthermore, our algorithm determines that dim(QP5)27=1985,\dim(Q\mathcal{P}_5)_{2^{7}} = 1985, which falls within the range 1984dim(QP5)2719901984 \leq \dim(Q\mathcal{P}_5)_{2^{7}} \leq 1990 as estimated in [15].

Keywords

Cite

@article{arxiv.2506.18392,
  title  = {A matrix criterion and algorithmic approach for the Peterson hit problem: Part I},
  author = {Dang Vo Phuc},
  journal= {arXiv preprint arXiv:2506.18392},
  year   = {2025}
}

Comments

47 pages. This version includes updated references and improved algorithms for enhanced execution efficiency. We welcome constructive comments and feedback on theoretical and practical aspects. We also welcome international collaboration in developing and extending our algorithms, particularly through implementation on the SageMath computer algebra system

R2 v1 2026-07-01T03:29:00.604Z