Pith. sign in

REVIEW

Surface-link families with arbitrarily large triple point number

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.13860 v3 pith:QN662AR2 submitted 2022-04-29 math.GT

classification math.GT
keywords numbersurface-linktriplearbitrarilypointbrokendiagramlarge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and given crossing information to create a broken sheet diagram. The triple point number of a surface-link is the minimal number of triple points among all broken sheet diagrams that lift to that surface-link. This paper generalizes a family of Oshiro to show that there are non-split surface-links of arbitrarily many trivial components whose triple point number can be made arbitrarily large.

Discussion (0). Continue with ORCID to comment.

Pith tools