Intersections of Virtual Multistrings

Document Type

Presentation Abstract

Presentation Date

10-12-2020

Abstract

Introduced by L. Kauffman (1999) and explicitly studied by V. Turaev (2004), a virtual multistring generalizes the notion of a collection of closed curves on a smooth surface. Considered up to virtual homotopy, virtual multistrings can be described both combinatorially and geometrically. Addressing a classical problem, we use the interplay between these perspectives to compute the minimal number of crossings for families of virtual multistrings. Along the way, we correct a previous misconception about "minimal" representatives of virtual multistrings. Throughout the talk, we will provide an overview of all requisite background.

Additional Details

October 12, 2020 at 3:00 p.m. via Zoom

This document is currently not available here.

Share

COinS