相关论文: Virtual Strings for Closed Curves with Multiple Co…

A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…

Vector space representations of words capture many aspects of word similarity, but such methods tend to make vector spaces in which antonyms (as well as synonyms) are close to each other. We present a new signed spectral normalized graph…

It is confirmed that geodesic string junctions are necessary to describe the gauge vectors of symmetry groups that arise in the context of IIB superstrings compactified in the presence of nonlocal 7-branes. By examining the moduli space of…

This paper concerns the motion of a relativistic string in a curved space-time. As a general framework, we first analyze relativistic string equations, i.e., the basic equations for the motion of a one-dimensional extended object in a…

The geometrical description of BPS 3-string junction in the F-theory background is given by lifting a string junction in IIB into F-theory and constructing a holomorphic curve in K3 with respect to a special complex structure of K3. The…

The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number,…

Let $X$ be a real algebraic variety with set of complex points $X_{\mathbb C}$ and set of real points $X_{\mathbb R}$. A complex slice of $X$ is a transverse intersection of $X_{\mathbb R}$ with a complex subvariety $V$ of $X_{\mathbb C}$.…

A flat virtual link is a finite collection of oriented closed curves $\mathfrak L$ on an oriented surface $M$ considered up to virtual homotopy, i.e., a composition of elementary stabilizations, destabilizations, and homotopies.…

What are strings made of? The possibility is discussed that strings are purely mathematical objects, made of logical axioms. More precisely, proofs in simple logical calculi are represented by graphs that can be interpreted as the Feynman…

In this paper we introduce a graph structure, called subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ where the vertex set is the collection of non-trivial proper subspaces of a vector space and…

Graph compression is a data analysis technique that consists in the replacement of parts of a graph by more general structural patterns in order to reduce its description length. It notably provides interesting exploration tools for the…

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

This tutorial gives an advanced introduction to string diagrams and graph languages for higher-order computation. The subject matter develops in a principled way, starting from the two dimensional syntax of key categorical concepts such as…

Computing occluding contours is a key building block of non-photorealistic rendering, but producing contours with consistent visibility has been notoriously challenging. This paper describes the first general-purpose smooth surface…

A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n^2 \log n)$ algorithm to compute the number of pairs of…

We introduce string diagrams as a formal mathematical, graphical language to represent, compose, program and reason about games. The language is well established in quantum physics, quantum computing and quantum linguistic with the…

In this paper we study global properties of the Wigner caustic of parameterized closed planar curves. We find new results on its geometry and singular points. In particular, we consider the Wigner caustic of rosettes, i.e. regular closed…

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…

Just as gauge theory describes the parallel transport of point particles using connections on bundles, higher gauge theory describes the parallel transport of 1-dimensional objects (e.g. strings) using 2-connections on 2-bundles. A 2-bundle…