光滑$A_n$ -实现问题的渐近性
Asymptotics of the smooth $A_n$-realization problem
摘要:
我们解决了一个渐进的变种光滑版本的$A_n$实现问题的平面曲线。作为应用,我们确定了$T(d,d)$型和$T(2,N)$型环面链之间的配边距离,误差最大为$3d$ .我们还讨论了结理论的方法,旨在解决的$A_n$实现问题的限制。
英文摘要:
We solve an asymptotic variant of a smooth version of the $A_n$-realization problem for plane curves. As an application, we determine the cobordism distance between torus links of type $T(d,d)$ and $T(2,N)$ up to an error of at most $3d$. We also discuss the limits of knot theoretic approaches aimed at solving the $A_n$-realization problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。