|
|
an algorithm for constructing a-annihilated admissible monomials in the dyer-lashof algebra
|
|
|
|
|
نویسنده
|
hasanzadeh mohammadali ,zare hadi
|
منبع
|
journal of finsler geometry and its applications - 2023 - دوره : 4 - شماره : 2 - صفحه:58 -63
|
چکیده
|
We present an algorithm for computing a-annihilated elements of the form q^i [1] in h*qs^0 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.
|
کلیدواژه
|
dyer-lashof algebra ,steenrod algebra ,λ algebra
|
آدرس
|
university of tehran, school of mathematics, statistics, and computer science, college of science, iran, university of tehran, school of mathematics, statistics, and computer science, college of science, iran
|
پست الکترونیکی
|
hadi.zare@ut.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|