An algorithmic strategy for finding characteristic maps over wedged simplicial complexes
| Autor: | Suyoung Choi, Mathieu Vallée |
|---|---|
| Přispěvatelé: | Department of Mathematics [Ajou] (Ajou University), Ajou University, Université de Rennes - UFR Mathématiques (UR Mathématiques), Université de Rennes (UR) |
| Rok vydání: | 2022 |
| Předmět: |
Mathematics - Geometric Topology
[MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT] General Mathematics [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] MathematicsofComputing_GENERAL FOS: Mathematics Mathematics - Combinatorics Geometric Topology (math.GT) Combinatorics (math.CO) 57S12 57-08 05E45 |
| Zdroj: | Pacific Journal of Mathematics Pacific Journal of Mathematics, 2022, 320 (1), pp.13-43. ⟨10.2140/pjm.2022.320.13⟩ |
| ISSN: | 1945-5844 0030-8730 |
| Popis: | 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. Comment: 24 pages, 3 tables |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|