On Virtual Crossing Number Estimates For Virtual Links
| dc.creator | Afanasiev, Denis | |
| dc.creator | Manturov, Vassily | |
| dc.date | 2008-11-05 | |
| dc.date.accessioned | 2026-07-07T10:15:41Z | |
| dc.date.available | 2026-07-07T10:15:41Z | |
| dc.description | 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 $R^{2}$. We tackle this problem by the so-called $ξ$-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. | |
| dc.description | 16 Pages, 11 Figures | |
| dc.identifier | https://arxiv.org/abs/0811.0712 | |
| dc.identifier | http://arxiv.org/abs/0811.0712 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173255 | |
| dc.subject | Geometric Topology | |
| dc.subject | 57M25 | |
| dc.title | On Virtual Crossing Number Estimates For Virtual Links | |
| dc.type | text |