ON VIRTUAL CROSSING NUMBER ESTIMATES FOR VIRTUAL LINKS

From MaRDI portal
Publication:3397598

DOI10.1142/S021821650900718XzbMATH Open1183.57002arXiv0811.0712OpenAlexW2963548486MaRDI QIDQ3397598FDOQ3397598


Authors: D. M. Afanasiev, V. O. Manturov Edit this on Wikidata


Publication date: 22 September 2009

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Abstract: We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic immersion of a singular link in R2. We tackle this problem by the so-called xi-polynomial whose leading (lowest) degree naturally estimates the virtual crossing number. Several sufficient conditions for minimality together with infinite series of new examples are given. We also state several open questions about M-diagrams, which are minimal according to our sufficient conditions.


Full work available at URL: https://arxiv.org/abs/0811.0712




Recommendations




Cites Work


Cited In (12)





This page was built for publication: ON VIRTUAL CROSSING NUMBER ESTIMATES FOR VIRTUAL LINKS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3397598)