2022
DOI: 10.48550/arxiv.2207.11870
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Torsion in the knot concordance group and cabling

Abstract: We define a nontrivial mod 2 valued additive concordance invariant defined on the torsion subgroup of the knot concordance group using involutive knot Floer package. For knots not contained in its kernel, we prove that their iterated (odd, 1)-cables have infinite order in the concordance group and, among them, infinitely many are linearly independent. Furthermore, by taking (2, 1)-cables of the aforementioned knots, we present an infinite family of knots which are strongly rationally slice but not slice. 2020 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…Therefore K n has infinite order in the smooth concordance group. To prove the linear independence part of Theorem 1.1, we recall more facts about I U K from [KP22]. Recall from [KP22, Section 4] that, for each n ≥ 2, the horizontal almost ι K -complex C n is generated by elements a n , b n , c n , d n , x n , where a n and x n have bidegree (0, 0).…”
Section: Proof Of the Main Theoremmentioning
confidence: 99%
See 3 more Smart Citations
“…Therefore K n has infinite order in the smooth concordance group. To prove the linear independence part of Theorem 1.1, we recall more facts about I U K from [KP22]. Recall from [KP22, Section 4] that, for each n ≥ 2, the horizontal almost ι K -complex C n is generated by elements a n , b n , c n , d n , x n , where a n and x n have bidegree (0, 0).…”
Section: Proof Of the Main Theoremmentioning
confidence: 99%
“…Remark 4.5. The argument used in the second part of the proof of Theorem 1.1 can be summarized as follows; note that the same argument was also used in [KP22]. Let {K n } be a sequence of rationally slice knots such that for any i ≥ 2, there exists a positive integer n i such that [K ni ] ≥ [C i ] in I U K .…”
Section: Proof Of the Main Theoremmentioning
confidence: 99%
See 2 more Smart Citations