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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The splitting number of a link is the minimal number of crossing changes between different components required to convert it into a split link. We obtain a lower bound on the splitting number in terms of the (multivariable) signature and nullity. Although very elementary and easy to compute, this bound turns out to be suprisingly efficient. In particular, it makes it a routine check to recover the splitting number of 129 out of the 130 prime links with at most 9 crossings. Also, we easily determine 16 of the 17 splitting numbers that were studied by Batson and Seed using Khovanov homology, and later computed by Cha, Friedl and Powell using a variety of techniques. Finally, we determine the splitting number of a large class of 2-bridge links which includes examples recently computed by Borodzik and Gorsky using a Heegaard Floer theoretical criterion.

Splitting numbers and signatures