We show that computation of the SPERNER problem is PPA-complete on Möbius band under proper boundary conditions, settling a long term open problem. Further, same computational complexity results extend to other discrete fixed points band, such as Brouwer point problem, DPZP and simple version Tucker well projective plane Klein bottle. expect it opens up new route for further studies related com...
