Related papers: String Diagram Rewrite Theory III: Confluence with…
We study the three string junctions and string networks in Type IIB string theory by explicity constructing the holomorphic embeddings of the M-theory membrane that describe such configurations. The main feature of them such as…
The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…
A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel compositions. Since different syntactic terms may represent the…
Confluence in abstract parallel category systems is established for net class-rewriting in iterative closed multilevel quotient graph structures with uncountable node arities by multi-dimensional transducer operations in topological metrics…
We tackle the problem of attributed graph transformations and propose a new algorithmic approach for defining parallel graph transformations allowing overlaps. We start by introducing some abstract operations over graph structures. Then, we…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
Feder and Subi conjectured that for any $2$-coloring of the edges of the $n$-dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at most once. We discuss the case of random colorings, and we…
The aim of superstring phenomenology is to develop the tools and methodology needed to confront string theory with experimental data. The first mandatory task is to find string solutions which reproduce the observable data. The subsequent…
In this paper we show that the chain recurrent set of a flow of automorphisms on a connected Lie group coincides with the central subgroup of the flow, if the group is decomposable. Moreover, in the decomposable case, the flow satisfies the…
A classic conjecture of F\"{u}redi, Kahn and Seymour (1993) states that given any hypergraph with non-negative edge weights $w(e)$, there exists a matching $M$ such that $\sum_{e \in M} (|e|-1+1/|e|)\, w(e) \geq w^*$, where $w^*$ is the…
We consider 4d N=1 theories arising from F-theory compactifications on elliptically-fibered Calabi-Yau four-folds and investigate the non-perturbative structure of their scalar field space beyond the large volume/large complex structure…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
Supersymmetric states in M-theory are mapped after compactification to perturbatively non-supersymmetric states in type IIA string theory, with the supersymmetric parts being encoded in the non-perturbative section of the string theory. An…
Let A be a finite dimensional, unital, and associative algebra which is endowed with a non-degenerate and invariant inner product. We give an explicit description of an action of cyclic Sullivan chord diagrams on the normalized Hochschild…
The holomorphy of the superpotential along with symmetries gives very strong constraints on any stringy non-perturbative effects. This observation suggests an approach to string phenomenology. (Presented at ``Strings 95'', March 1995.
This paper is centered on the random graph generated by a Doeblin-type coupling of discrete time processes on a countable state space whereby when two paths meet, they merge. This random graph is studied through a novel subgraph, called a…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
We demonstrate the irreversibility of a wide class of world-sheet renormalization group (RG) flows to first order in $\alpha'$ in string theory. Our techniques draw on the mathematics of Ricci flows, adapted to asymptotically flat target…
We present a new open superstring field theory, whose string fields carry an arbitrary picture number and reside in the large Hilbert space. The redundancy related to picture number is resolved by treating picture changing as a gauge…
C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) the following conjectures : 1. Every 3-strongly connected…