2000 character limit reached
Bennequin-Plamenevskaya-Shumakovitch Type Inequalities for Kronheimer-Mrowka's Concordance Invariant
Published 1 Sep 2023 in math.GT | (2309.00415v2)
Abstract: We give Bennequin-Plamenevskaya-Shumakovich type lower bounds for the concordance invariant $s{#}$ introduced by Kronheimer and Mrowka. The proof is a consequence of computations for torus knots and the cobordism inequality of $s{#}$ due to Gong, combined with well-known arguments used for slice-torus invariants.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.