English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The puzzle method was introduced by Choi and Park as an effective method forfinding non-singular characteristic maps over wedged simplicial complexes$K(J)$ obtained from a given simplicial complex $K$. We study further the mod 2case of the puzzle method. We firstly describe it completely in terms of linearalgebraic language which allows us to develop a constructive puzzle algorithm.We also analyze our algorithm and compare its performances with other knownalgorithms including the Garrison and Scott algorithm.

An algorithmic strategy for finding characteristic maps over wedged simplicial complexes