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

Motivated by string theory and standard model physics, we discuss the possibility of other particles-based quantum information. A special attention is put on the consideration of the graviton in light of the gravitational wave detection.…

Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…

Let G be an arbitrary simple graph. The main results are explicit representations of the edge cone of G as a finite intersection of closed halfspaces. If G is bipartite and connected we determine the facets of the edge cone and present a…

A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…

A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…

Letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word $xyxy\cdots$ (of even or odd length) or a word $yxyx\cdots$ (of even or odd length). A graph $G=(V,E)$ is…

The objective of this paper is to further study the anabelian object referred to as \emph{pointed virtual curves}. Building upon previous work that investigated these fundamental-group-theoretic pullbacks of Galois sections in the…

A directed graph G (V, E) is strongly connected if and only if, for a pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is…

The gauge invariant observables of the closed bosonic string are quantized without anomalies in four space-time dimensions by constructing their quantum algebra in a manifestly covariant approach. The quantum algebra is the kernel of a…

A picture P of a graph G = (V,E) consists of a point P(v) for each vertex v in V and a line P(e) for each edge e in E, all lying in the projective plane over a field k and subject to containment conditions corresponding to incidence in G. A…

This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to…

A common task in computational text analyses is to quantify how two corpora differ according to a measurement like word frequency, sentiment, or information content. However, collapsing the texts' rich stories into a single number is often…

For any reduced curve $C\subset \mathbb P^2$, we define the notions of the number of its virtual cusps $c_v$ and the number of its virtual nodes $n_v$ which are non-negative, coincide respectively with the numbers of ordinary cusps and…

We introduce string diagrams for physical duoidal categories (normal $\otimes$-symmetric duoidal categories): they consist of string diagrams with wires forming a zigzag-free partial order and order-preserving nodes whose inputs and outputs…

String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the last years given the massive use of strings in different application…

A voltage graph is a finite directed graph whose edges are labeled by elements of a finite group $G$. A classical construction of Gross and Tucker associates to every voltage graph with vertex set $V$ a so-called derived graph with vertex…

Skip-gram (word2vec) is a recent method for creating vector representations of words ("distributed word representations") using a neural network. The representation gained popularity in various areas of natural language processing, because…

Virtual knot theory, introduced by Kauffman, is a generalization of classical knot theory of interest because its finite-type invariant theory is potentially a topological interpretation of Etingof and Kazhdan's theory of quantization of…

We study the virtual intersection theory of Hyperquot schemes parameterizing sequences of quotient sheaves of a vector bundle on a smooth projective curve. Our results generalize the Vafa--Intriligator formula for Quot schemes and provide a…

One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…