An algorithm for constructing A-annihilated admissible monomials in the Dyer-Lashof algebra

Document Type : Original Article


School Of Mathematics, Statistics, And Computer Science College Of Science University Of Tehran


We present an algorithm for computing A-annihilated elements of the form QI[1] in H*QS0 where I runs through admissible sequences of positive excess. This is algorithm with polynomial time complexity to address a sub-problem of an unsolved problem in algebraic topology known as the hit problem of Peterson which is likely to be NP-hard.