On the dimension of \(H^\ast( ( \mathbb{Z}_2 )^{\times t}, \mathbb{Z}_2)\) as a module over Steenrod ring (Q2665199)

This paper is about the famous hit problem of Peterson. For a group \(G\), its group cohomology coincides with cohomology of the space \(BG\). Accordingly the paper is about \(H^*((\mathbb{R} P)^{\times t};\mathbb{Z}_2)\) where \(\mathbb{Z}_2\) is cyclic group of order \(2\) and \((\mathbb{R} P)^{\times t}=B(\mathbb{Z}_2^{\times t})=(B\mathbb{Z}_2)^{\times t}\) with \(\mathbb{R}P\) being the infinite dimensional real projective space. The important object in the hit problem is the quotient module of `cohit' elements (called `unhit' elements in this paper) defined by \[Q(t)=\mathbb{Z}_2\otimes_A H^*((\mathbb{R} P)^{\times t};\mathbb{Z}_2)\] where \(\mathbb{Z}_2\) is considered as a graded \(A\)-module concentrated in degree \(0\) through the augmentation of the mod \(2\) Steenrod algebra \(A\). The important task is then to determine the cohit module by means of determining a \(\mathbb{Z}_2\)-basis for this vector space, or at least providing an upper bound on the dimension of this module in specific cases. It is worth noting that the problem remains open for \(n>5\), with \(n<4\) being solved and the case of \(n=5\) being pursued by the author in a series of papers. The techniques of the paper are standard ones such as use of the Kameko map or the weight vectors (see [\textit{N. Sum}, Adv. Math. 225, No. 5, 2365--2390 (2010; Zbl 1203.55009)] or [\textit{G. Walker} and \textit{R. M. W. Wood}, Polynomials and the mod 2 Steenrod algebra. Volume 1: The Peterson hit problem. Cambridge: Cambridge University Press (2018; Zbl 1387.55001); Polynomials and the mod 2 Steenrod algebra. Volume 2: Representations of GL\((n,F_2)\). Cambridge: Cambridge University Press (2018; Zbl 1390.55001)] for a summary of available techniques). The author provides a list of detailed computations and determines the dimension of \(Q(5)\) in a family of gradings (see Theorem 1.5 and Theorem 1.7 for example). The tables and dimensions could be of interest for people working in the field, at least with an eye of seeing a general pattern. However, the most interesting part of the paper to the reviewer has been the algorithmic approach with the algorithm recorded at the appendix. Indeed, with problems that rely on such heavy computations there is always a possibility of human error, and the use of machine power and algorithmic computations seems a natural thing to do bearing in mind the immense power of machine based computing compared to their power when the problem was introduced by Peterson.