The puzzle method was introduced by Choi and Park as an effective method for finding nonsingular characteristic maps over wedged simplicial complexes K( J) obtained from a given simplicial complex K. We study further the mod 2 case of the puzzle method. We firstly describe it completely in terms of linear algebraic language which allows us to develop a constructive puzzle algorithm. We also analyze our algorithm and compare its performances with other known algorithms including the Garrison and Scott algorithm.
This project was supported by the National Research Foundation of Korea Grant funded by the Korean Government (NRF-2019R1A2C2010989). MSC2020: primary 57-08, 57S12; secondary 05E45. Keywords: puzzle method, puzzle algorithm, algorithmic strategy, wedge operation, wedged simplicial complex, characteristic map, small covers, toric topology.
