Guozhen Wang’s MinimalResolution code computes Ext groups over BP_* BP and the C-motivic Steenrod algebra, and is amenable to adaptation to other Hopf algebroids. I will give an overview of what Wang’s code does and how it works. I will also talk about my work applying the resulting computer-generated Adams-Novikov E_2 data to (mostly painlessly) re-compute pi_n(S) at p=3 for n <= 108.

Many homotopy theory research projects involve concrete spectral sequences and profit from visual communication with charts. These charts are helpful at many different stages of the research process: for investigating, for writing, and for speaking about math. They also have an important pedagogical role in improving the accessibility of existing knowledge.

I have been long interested in producing software that helps to enable the production and sharing of charts. My goal is to create a toolkit for producing and editing diagrams which can be displayed as an interactive webpage or rendered into a latex diagram. Such software should be as accessible as possible, meaning that it should be easy to install, easy to run, and easy to learn how to use.

I will describe where I think we are now and where I think we are going.

This is joint work with Dexter Chua (but these are my personal opinions and have not been endorsed by Dexter).

Given a fixed number of generators for a DGA, if there are fewer relations among them, the DGA tends to be larger as a vector space. The extreme cases are polynomial DGAs and DGAs with trivial products. To compute the homology efficiently, one may need to use different algorithms depending on the number of relations. In this talk, I will demonstrate several algorithms I use in my computation of the May spectral sequence over F_2. Most of the algorithms rely on the theory of Groebner bases. I will give an introduction to Groebner bases before the algorithms.

In the early 2000’s, Baues introduced and computed the secondary Steenrod algebra, which in turn gives a computer algorithm to compute all Adams d2 differentials. In this talk, I will give a modern reformulation of these results, and explain how this can be used to compute new (and longer!) differentials in the Adams spectral sequence.

The A^1-degree is an analog of the Brouwer degree in motivic homotopy theory. Over a field k, the A^1-degree takes values in isomorphism classes of quadratic forms over k. In this talk, I will describe joint work with Thomas Brazelton and Sabrina Pauli that gives a complete formula for the A^1-degree in terms of commutative algebra. I will then discuss how we implemented this formula in Sage, demonstrate the code with examples from enumerative geometry, and detail parts of the code that could be improved.

We showcase a cohomology package (github.com/cnassau/yacop-sage) for the SageMath computer algebra system that has been in incubation since 2009 (and is currently in a state of mild disrepair). We’ll try to make this talk interesting for both technically minded programmers and homotopy theorists that are looking for tools to help with specific computations.

The author’s package ‘ext’ of C-programs and Unix shell scripts has been used to compute Ext_A(F2, F2) through internal degree 184 together with all products and certain Massey products, and to give sufficiently precise descriptions of Ext_A(2)(H^* X, F2) to compute tmf_*(X), for several X, including the cofibers of 2, eta and nu. Finally, it very quickly gives initial segments of the E_2 term of the Adams spectral sequence for many spectra, together with chain maps lifting any cocycle.

The talk will describe some of these calculations and demonstrate them in action.