Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Peterson hit problem

Published 10 Dec 2014 in math.AT | (1412.3309v2)

Abstract: We study the hit problem, set up by F. Peterson, of finding a minimal set of generators for the polynomial algebra $P_k := \mathbb F_2[x_1,x_2,...,x_k]$ as a module over the mod-2 Steenrod algebra, $\mathcal{A}$. In this paper, we study a minimal set of generators for $\mathcal A$-module $P_k$ in some so-call generic degrees and apply these results to explicitly determine the hit problem for $k=4$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.