Abstract

This paper highlights the importance of string link concordance in the understanding of knot concordance in general. The results of this paper show that there are infinitely many nontrivial knots in the groups Gn of n‐solvable knots modulo n:5‐solvable knots, for n greater than or equal to 2, which are not concordant to any knot that is obtained by two or more iterated infections of an Arf invariant zero knot by knots. This latter class accounts for nearly all previously known examples of knots in Gn , n greater than or equal to 2. In this paper we will generalize the concept of when a rational Laurent polynomial is strongly coprime to another, first introduced by Cochran, Harvey and Leidy, to include multivariable polynomials. We also prove the existence of multivariable polynomials which are strongly coprime to all single variable Laurent polynomials. From this definition of coprimality we define the derived series localized at M for a given sequence of multivariable polynomials M. From such series we obtain refinements of the n‐solvable filtration. The operation of infection by a string link is then used to demonstrate that for particular M, certain quotients of successive terms of these refined filtrations have infinite rank. 57M25; 20J05

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.