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.
Zare, H., & Hasanzadeh, S. M. (2023). An algorithm for constructing A-annihilated admissible monomials in the Dyer-Lashof algebra. Journal of Finsler Geometry and its Applications, 4(2), 58-63. doi: 10.22098/jfga.2023.13656.1098
MLA
Hadi Zare; Seyyed Mohammadali Hasanzadeh. "An algorithm for constructing A-annihilated admissible monomials in the Dyer-Lashof algebra". Journal of Finsler Geometry and its Applications, 4, 2, 2023, 58-63. doi: 10.22098/jfga.2023.13656.1098
HARVARD
Zare, H., Hasanzadeh, S. M. (2023). 'An algorithm for constructing A-annihilated admissible monomials in the Dyer-Lashof algebra', Journal of Finsler Geometry and its Applications, 4(2), pp. 58-63. doi: 10.22098/jfga.2023.13656.1098
VANCOUVER
Zare, H., Hasanzadeh, S. M. An algorithm for constructing A-annihilated admissible monomials in the Dyer-Lashof algebra. Journal of Finsler Geometry and its Applications, 2023; 4(2): 58-63. doi: 10.22098/jfga.2023.13656.1098
)