Computing the homology of the lambda algebra (Q3706946)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3935979
Language Label Description Also known as
default for all languages
No label defined
    English
    Computing the homology of the lambda algebra
    scientific article; zbMATH DE number 3935979

      Statements

      Computing the homology of the lambda algebra (English)
      0 references
      0 references
      1985
      0 references
      lambda algebra
      0 references
      Ext-groups over the Steenrod algebra
      0 references
      \(E_ 2\)-term of the classical Adams spectral sequence
      0 references
      stable homotopy groups of spheres
      0 references
      unstable Adams spectral sequence
      0 references
      Hopf invariants
      0 references
      Curtis table
      0 references
      For each prime p the lambda algebra \(\Lambda =\Lambda_ p\) is an associative not commutative bi-graded differential algebra over \({\mathbb{F}}_ p\) whose cohomology groups are the Ext-groups over the Steenrod algebra, i.e. the \(E_ 2\)-term of the classical Adams spectral sequence for the stable homotopy groups of spheres. Moreover it contains, for each \(n>0\), a differential subalgebra whose cohomology is the \(E_ 2\)-term of an unstable Adams spectral sequence for \(S^ n\). Stable and unstable information including Hopf invariants and spheres of origin can be put together in form of what is sometimes called a Curtis table. Since the structure of the \(\Lambda\)-algebra is described by a few simple formulas, it looks promising to use it for machine computations. However without further reducing, it is still too large for actual computations. The aim of this paper is to show how one can get round this difficulty. After a short description of the \(\Lambda\)-algebra the author, using previous work of Curtis, discusses and sets up an algorithm for computing such Curtis tables. The paper contains several tricks and tools which are useful in doing this. The author gives an explicit computer program in SNOBOL for this algorithm together with a detailed discussion of the time, managing and storage problems which arise in programming such an algorithm. Extensive tables of computing results occupying about 80 pages are included for \(p=2\) and \(p=3\). A very pleasant point is that the paper deals in detail with the slightly more complicated and badly documented odd primary case.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references