Related papers: String Diagram Rewrite Theory III: Confluence with…
String geometry theory is one of the candidates of a non-perturbative formulation of string theory. In this theory, the ``classical'' action is almost uniquely determined by T-symmetry, which is a generalization of the T-duality, where the…
In the Cluster Editing problem, sometimes known as (unweighted) Correlation Clustering, we must insert and delete a minimum number of edges to achieve a graph in which every connected component is a clique. Owing to its applications in…
Double-pushout rewriting is an established categorical approach to the rule-based transformation of graphs and graph-like objects. One of its standard results is the construction of concurrent rules and the Concurrency Theorem pertaining to…
A popular graphical calculus for monoidal categories makes computations tactile and intuitive. Complicated diagram chases can be expressed in a few pictures and discovered by playing with a shoelace. Joyal and Street's proof of the…
We consider the problem of binary string reconstruction from the multiset of its substring compositions, i.e., referred to as the substring composition multiset, first introduced and studied by Acharya et al. We introduce a new algorithm…
With the popularization of Topological Data Analysis, the Reeb graph has found new applications as a summarization technique in the analysis and visualization of large and complex data, whose usefulness extends beyond just the graph itself.…
I argue that the ten dimensional non--supersymmetric tachyonic superstrings may serve as good starting points for the construction of viable phenomenological vacua. Thus, enlarging the space of possible solutions that may address some of…
Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the…
We start a systematic analysis of supersymmetric field theories in six dimensions. We find necessary conditions for the existence of non-trivial interacting fixed points. String theory provides us with examples of such theories. We…
We generalize Gopakumar's microscopic derivation of Witten diagrams in large N free quantum field theory [1] to interacting theories in perturbative expansion. For simplicity we consider a matrix scalar field with $\Phi^h$ interaction in d…
Graph rewriting is a popular tool for the optimisation and modification of graph expressions in domains such as compilers, machine learning and quantum computing. The underlying data structures are often port graphs - graphs with labels at…
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…
Given a Counting Monadic Second Order (CMSO) sentence $\psi$, the CMSO$[\psi]$ problem is defined as follows. The input to CMSO$[\psi]$ is a graph $G$, and the objective is to determine whether $G\models \psi$. Our main theorem states that…
Sufficient conditions of consensus (synchronization) in networks described by digraphs and consisting of identical determenistic SIMO systems are derived. Identical and nonidentical control gains (positive arc weights) are considered.…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
We study the bosonic sector of a decoupling limit of type IIA superstring theory, where a background Ramond-Ramond one-form is fined tuned to its critical value, such that it cancels the associated background D0-brane tension. The light…
Complex networks possess a rich, multi-scale structure reflecting the dynamical and functional organization of the systems they model. Often there is a need to analyze multiple networks simultaneously, to model a system by more than one…
Noncommutative \phi^3 field theory in six dimensions exhibits the logarithmic UV/IR mixing at the two-loop order. We show that open string theory in the presence of constant background NS-NS two-form field yields the same amplitude upon…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
Given a graph and two vertex sets satisfying a certain feasibility condition, a reconfiguration problem asks whether we can reach one vertex set from the other by repeating prescribed modification steps while maintaining feasibility. In…