相关论文: Virtual Strings for Closed Curves with Multiple Co…
Path calculus, or graphical linear algebra, is a string diagram calculus for the category of matrices over a base ring. It is the usual string diagram calculus for a symmetric monoidal category, where the monoidal product is the direct sum…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
A string theory in $3$ euclidean spacetime dimensions is found to describe the semiclassical behavior of a certain exact physical state of quantum general relativity in $4$ dimensions. Both the worldsheet and the three dimensional metric…
We formulate the task of detecting lines and paragraphs in a document into a unified two-level clustering problem. Given a set of text detection boxes that roughly correspond to words, a text line is a cluster of boxes and a paragraph is a…
We extend the synthetic theories of discrete and Gaussian categorical probability by introducing a diagrammatic calculus for reasoning about hybrid probabilistic models in which continuous random variables, conditioned on discrete ones,…
String geometry theory is one of the candidates of the non-perturbative formulation of string theory. In this paper, in the bosonic closed sector of string geometry theory, we completely identify the perturbative vacua, which include…
In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation---a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices $u,v$ intersect…
The complete quantum theory of closed superstrings is constructed using string diagrams endowed with metric having constant curvature $-1$. The elementary string diagrams are equipped with the analytic local coordinates induced from the…
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…
Word2vec (Mikolov et al., 2013) has proven to be successful in natural language processing by capturing the semantic relationships between different words. Built on top of single-word embeddings, paragraph vectors (Le and Mikolov, 2014)…
Let $\mathcal{X}$ be a projective algebraic curve and denote by $\mathcal{X}^{'}$ its strict dual curve. The map $\gamma:\mathcal{X} \longrightarrow \mathcal{X}^{'}$ is called (strict) Gauss map of $\mathcal{X}$. In this manuscript, we…
We study the Gauss map and the dual variety of a real-analytic immersion of a connected compact real-analytic manifold into a sphere or into a hyperbolic space. The dual variety is defined to be the set of all normal directions of the…
The popular bag of words assumption represents a document as a histogram of word occurrences. While computationally efficient, such a representation is unable to maintain any sequential information. We present a continuous and…
We propose a new approach to the Chinese word segmentation problem that considers the sentence as an undirected graph, whose nodes are the characters. One can use various techniques to compute the edge weights that measure the connection…
A graph $G$ with vertex set $V(G)$ and edge set $E(G)$ is said to be word-representable if there exists a word $w$ over the alphabet $V(G)$ such that, for any two distinct letters $x,y \in V(G)$, the letters $x$ and $y$ alternate in $w$ if…
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. The word-representability of split graphs was studied in a series of papers in the literature, and the class of word-representable split…
We formulate and solve a class of two-dimensional matrix gauge models describing ensembles of non-folding surfaces covering an oriented, discretized, two-dimensional manifold. We interpret the models as string theories characterized by a…
A chord diagram is a circle with paired points with each pair of points connected by a chord. Every generic immersed spherical curve provides a chord diagram by associating each chord with two preimages of a double point. Any two spherical…
Each free homotopy class of directed closed curves on a surface with boundary can be described by a cyclic reduced word in the generators of the fundamental group and their inverses. The word length is the number of letters of the cyclic…
The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact representations. Here we first survey various forms of one…