Computing a minimal resolution over the Steenrod algebra
Abstract
We describe an algorithm that allows to compute a minimal resolution of the Steenrod algebra. The algorithm has built-in knowledge about vanishing lines for the cohomology of sub Hopf algebras of the Steenrod algebra which makes it both faster and more economical than the generic approach.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.