Related papers: Virtual Strings for Closed Curves with Multiple Co…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…
Given a unit vector field on a closed Euclidean hypersurface, we define a map from the hypersurface to a sphere in the Euclidean space. This application allows us to exhibit a list of topological invariants which combines the second…
We introduce a new cohomology-theoretic method for classifying generic immersed curves in closed compact surfaces by using Gauss codes. This subsumes a result of J.S. Carter on classifying immersed curves in oriented compact surfaces, and…
The complete set of solutions of two dimensional classical string theory are constructed for any curved spacetime. They describe folded strings moving in curved spacetime. Surprizing stringy behavior becomes evident at singularities such as…
An outerstring graph is an intersection graph of curves that lie in a common half-plane and have one endpoint on the boundary of that half-plane. We prove that the class of outerstring graphs is $\chi$-bounded, which means that their…
In this paper we obtain an explicit formula for the number of curves in two dimensional complex projective space, of degree d, passing through d(d+3)/2-(k+1) generic points and having one node and one codimension k singularity, where k is…
In this paper we prove that a graph is a string graph (the intersection graph of curves in the plane) if and only if it admits a drawing in the plane with certain properties. This also allows us to define an algebraic obstruction, similar…
In bosonic string theory, the solutions to the string equations of motion may be expressed as two-dimensional manifolds in a relativistic spacetime. We develop MATLAB software for the generation of open and closed string solutions and for…
Two natural generalizations of knot theory are the study of spatial graphs and virtual knots. Our goal is to unify these two approaches into the study of virtual spatial graphs. This paper is a survey, and does not contain any new results.…
Let $E$ be a rank 2, degree $d$ vector bundle over a genus $g$ curve $C$. The loci of stable pairs on $E$ in class $2[C]$ fixed by the scaling action are expressed as products of $\Quot$ schemes. Using virtual localization, the stable pairs…
A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…
Let $S$ be a complete flat surface, such as the Euclidean plane. We obtain direct characterizations of the connected components of the space of all curves on $S$ which start and end at given points in given directions, and whose curvatures…
Confining strings in 4D are effective, thick strings describing the confinement phase of compact U(1) and, possibly, also non-Abelian gauge fields. We show that these strings are dual to the gauge fields, inasmuch as their perturbative…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
In the present paper we give an explicit formula which allows us immediately to describe a unique Gauss circuit on a framed 4-valent graph (a graph with a structure of opposite edges) from an arbitrary Euler tour on the graph whenever the…
We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…
A full quantum description of global vortex strings is presented in the framework of a pure Higgs system with a broken global U(1) symmetry in 3+1D. An explicit expression for the string creation operator is obtained, both in terms of the…
An intersection graph of curves in the plane is called a string graph. Matousek almost completely settled a conjecture of the authors by showing that every string graph of m edges admits a vertex separator of size O(\sqrt{m}\log m). In the…
We consider the group of unrestricted virtual braids, describe its structure and explore its relations with fused links. Also, we define the groups of flat virtual braids and virtual Gauss braids and study some of their properties, in…
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, $\tau$. Paths are sequences of adjacent edges whose appearing times are either strictly increasing or non-strictly increasingly…