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

TL;DR
This paper introduces a linear algebra-based criterion and algorithmic approach to systematically compute the dimension of the Peterson hit problem quotient space, improving accuracy and efficiency over manual methods.
Contribution
It develops a practical algorithm implemented in SageMath for determining hit space dimensions, correcting previous manual calculations and providing a systematic computational tool.
Findings
Corrected the dimension of QP_5 in degree 64 from previous manual results.
Determined that dim(QP_5) in degree 128 is 1985.
Provided a reliable computational method for arbitrary k and degrees.
Abstract
The Peterson hit problem in algebraic topology is to explicitly determine the dimension of the quotient space in positive degrees, where denotes the polynomial algebra in variables over the field , considered as an unstable module over the Steenrod algebra . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
