An algorithmic strategy for finding characteristic maps over wedged simplicial complexes

Download

• Paper

Abstract

The puzzle method was introduced by Choi and Park as an effective method for finding non-singular 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.

Citation

Choi, Suyoung, and Mathieu Vallée. 2022. “An algorithmic strategy for finding characteristic maps over wedged simplicial complexes.” Pacific Journal of Mathematics 320 (1): 13–43. https://doi.org/10.2140/pjm.2022.320.13

@article{Choi_Vallée_2022b,
  author = {Suyoung Choi and Mathieu Vallée},
  year = {2022},
  title = {An algorithmic strategy for finding characteristic maps over wedged simplicial complexes},
  journal = {Pacific J. Math.},
  volume = {320},
  number = {1},
  pages = {13–43},
  doi = {10.2140/pjm.2022.320.13},
  rights = {All rights reserved},
}