相关论文: The Twisted String Vertex Algorithm Applied to the…

We study matrix quantum mechanics at a finite temperature equivalent to one dimensional compactified string theory with vortex (winding) excitations. It is explicitly demonstrated that the states transforming under non-trivial U(N)…

A random recursive cell splitting scheme of the $2$-dimensional unit sphere is considered, which is the spherical analogue of the STIT tessellation process from Euclidean stochastic geometry. First-order moments are computed for a large…

The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets that satisfy specified size constraints. In the paper 10.1016/j.ejor.2014.05.042, the…

We study the tomography of propagators for spin systems in the context of finite-dimensional Wigner representations, which completely characterize and visualize operators using shapes assembled from linear combinations of spherical…

Anomalous dimensions of twist-two operators govern the scale evolution of parton distribution functions. For off-shell external states, the physical twist-two operators mix with unknown gauge-variant operators under renormalization. In this…

In the past decade, we had developed a series of splitting contraction algorithms for separable convex optimization problems, at the root of the alternating direction method of multipliers. Convergence of these algorithms was studied under…

We enumerate the number of $T$-splitting subspaces of dimension $m$ for an arbitrary operator $T$ on a $2m$-dimensional vector space over a finite field. When $T$ is regular split semisimple, comparison with an alternate method of…

The problem of constructing twisted modules for a vertex operator algebra and an automorphism has been solved in particular in two contexts. One of these two constructions is that initiated by the third author in the case of a lattice…

In the Vertex Triangle 2-Club problem, we are given an undirected graph $G$ and aim to find a maximum-vertex subgraph of $G$ that has diameter at most 2 and in which every vertex is contained in at least $\ell$ triangles in the subgraph. So…

The computation of long range linear self-interaction forces in string and higher dimensional brane models requires the evaluation of the gradients of regularised values of divergent self-interaction potentials. It is shown that the…

The role of integrable systems in string theory is discussed. We remind old examples of the correspondence between stringy partition functions or effective actions and integrable equations, based on effective application of the matrix model…

Motivated by phenomenological questions in quantum gravity, we consider the propagation of a scalar field on a random lattice. We describe a procedure to calculate the dispersion relation for the field by taking a limit of a periodic…

This work is motivated by the recent evidence for a double-copy relationship between open- and closed-string amplitudes in Anti-de Sitter (AdS) space. At present, the evidence has the form of a double-copy relation for string-amplitude…

We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is…

In this paper we relate the matrix $S_B$ of the second moments of a spherically truncated normal multivariate to its full covariance matrix $\Sigma$ and present an algorithm to invert the relation and reconstruct $\Sigma$ from $S_B$. While…

Motivated by arXiv:1203.5553, we continue to match super string amplitudes with their own effective field theory. We carry out within full details the computations of the complete form of the amplitude of one closed string Ramond-Ramond…

We study mass-deformed N=2 gauge theories from various points of view. Their partition functions can be computed via three dual approaches: firstly, (p,q)-brane webs in type II string theory using Nekrasov's instanton calculus, secondly,…

In this work an iterative algorithm based on unsupervised learning is presented, specifically on a Restricted Boltzmann Machine (RBM) to solve a perfect matching problem on a bipartite weighted graph. Iteratively is calculated the weights…

We present a construction of a perturbatively stable non-supersymmetric type II closed string model in four dimensions. It is based on a freely acting Scherk-Schwarz Z2-deformation of a supersymmetric construction which is recovered in…

In this paper, we develop a two-stage distributed algorithm that enables nodes in a graph to cooperatively estimate the spectrum of a matrix $W$ associated with the graph, which includes the adjacency and Laplacian matrices as special…