|
|||||
|
|
|
|
|
|
|
|
|
|
|
|
|
An algorithmic
strategy for finding characteristic maps over wedged
simplicial complexes
Suyoung Choi and Mathieu Vallée |
|
Vol. 320 (2022), No. 1, 13–43
|
Abstract |
|
The puzzle method was introduced by Choi and Park as an effective method for finding nonsingular characteristic maps over wedged simplicial complexes obtained from a given simplicial complex . We study further the mod 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. |
PDF Access Denied
We have not been able to recognize your IP address
3.137.162.110
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 40.00:
Keywords
puzzle method, puzzle algorithm, algorithmic strategy,
wedge operation, wedged simplicial complex, characteristic
map, small covers, toric topology
|
Mathematical Subject Classification
Primary: 57-08, 57S12
Secondary: 05E45
|
Milestones
Received: 29 January 2022
Revised: 14 July 2022
Accepted: 24 July 2022
Published: 16 October 2022
|
Authors |
| Suyoung Choi | |
| Department of Mathematics Ajou University Suwon South Korea |
|
| Mathieu Vallée | |
| Univ Rennes CNRS, IRMAR - UMR 6625 Rennes France |
|
