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

A theory of complexity for pairs (M,G) with M an arbitrary closed 3-manifold and G in M a 3-valent graph was introduced by the first two named authors, extending the original notion due to Matveev. The complexity c is known to be always additive under connected sum away from the graphs, but not always under connected sum along (unknotted) arcs of the graphs. In this article, we prove the slightly surprising fact that if in M there is a sphere intersecting G transversely at one point, and this point belongs to an edge e of G, then e can be canceled from G without affecting the complexity. Using this fact we completely characterize the circumstances under which complexity is additive under connected sum along graphs. For the set of pairs (M,K) with K in M a knot, we also prove that any function that is fully additive under connected sum along knots is actually a function of the ambient manifold only

NOTES ON THE COMPLEXITY OF 3-VALENT GRAPHS IN 3-MANIFOLDS