Search results for "string"

The Einstein field equation in a multidimensional universe

1988

String theory [4] predicts that the universe has 10 or 26 dimensions. A salient problem is how the Einstein field equation should be written in terms of these revivified Kaluza-Klein cosmologies. The answer is by now well-known, yet nobody seems to have rewritten the seminal computation in [6] where an unnecessarily involved Euler-Lagrange variational method is employed and, curiously enough, no allusion to the Gauss-Bonnet-Chern theorem is made. We provide a more straightforward argument, which has been inspired by Hilbert's original derivation of the Einstein field equation [5].

Spectrum of the QCD flux tube in 3d SU(2) lattice gauge theory

2009

Abstract Evidence from the lattice suggests that formation of a flux tube between a q q ¯ pair in the QCD vacuum leads to quark confinement. For large separations between the quarks, it is conjectured that the flux tube has a behavior similar to an oscillating bosonic string, supported by lattice data for the groundstate q q ¯ potential. We measure the excited states of the flux tube in 3d SU ( 2 ) gauge theory with three different couplings inside the scaling region. We compare our results to predictions of effective string theories.

Renormalization aspects of chaotic strings

2014

Chaotic strings are a class of non-hyperbolic coupled map lattices, exhibiting a rich structure of complex dynamical phenomena with a surprising correspondence to physical contents. In this paper we introduce different types and models for chaotic strings, where 2B-strings with finite length are considered in detail. We demonstrate possibilities to extract renormalized quantities, which are expected to describe essential properties of the string.

Coupled-cluster Theory

2002

N-string vertices in string field theory.

1993

We give the general form of the vertex corresponding to the interaction of an arbitrary number of strings. The technique employed relies on the ``comma" representation of String Field Theory where string fields and interactions are represented as matrices and operations between them such as multiplication and trace. The general formulation presented here shows that the interaction vertex of N strings, for any arbitrary N, is given as a function of particular combinations of matrices corresponding to the change of representation between the full string and the half string degrees of freedom.

Light majoron cold dark matter from topological defects and the formation of boson stars

2019

We show that for a relatively light majoron ($\ll 100 $ eV) non-thermal production from topological defects is an efficient production mechanism. Taking the type I seesaw as benchmark scheme, we estimate the primordial majoron abundance and determine the required parameter choices where it can account for the observed cosmological dark matter. The latter is consistent with the scale of unification. Possible direct detection of light majorons with future experiments such as PTOLEMY and the formation of boson stars from the majoron dark matter are also discussed.

r-Indexing the eBWT

2021

The extended Burrows Wheeler Transform (\(\mathrm {eBWT}\)) was introduced by Mantaci et al. [TCS 2007] to extend the definition of the \(\mathrm {BWT}\) to a collection of strings. In our prior work [SPIRE 2021], we give a linear-time algorithm for the \(\mathrm {eBWT}\) that preserves the fundamental property of the original definition (i.e., the independence from the input order). The algorithm combines a modification of the Suffix Array Induced Sorting (SAIS) algorithm [IEEE Trans Comput 2011] with Prefix Free Parsing [AMB 2019; JCB 2020]. In this paper, we show how this construction algorithm leads to r-indexing the \(\mathrm {eBWT}\), i.e., run-length encoded \(\mathrm {eBWT}\) and \(…

Learning of regular expressions by pattern matching

1995

We consider the problem of restoring regular expressions from good examples. We describe a natural learning algorithm for obtaining a “plausible” regular expression from one example. The algorithm is based on finding the longest substring which can be matched by some part of the so far obtained expression. We believe that the algorithm to a certain extent mimics humans guessing regular expressions from the same sort of examples. We show that for regular expressions of bounded length successful learning takes time linear in the length of the example, provided that the example is “good”. Under certain natural restrictions the run-time of the learning algorithm is polynomial also in unsuccessf…

A New Technical Approach For Retrograde Administration of Cardioplegic Solutions

1989

Myocardial protection via the coronary sinus is now currently used by several groups. Although it has generally provided satisfactory results, some of its problems are still not completely resolved. We present a new technique of cardioplegia delivery through the coronary sinus with a Pezzer catheter inserted into it and secured in place by a purse string suture. We believe that this method is safer and more reliable than others.

The three-vertex in the closed half-string field theory and the general gluing and resmoothing theorem

1997

In this letter we prove that the half-string three-vertex in closed string field theory satisfies the general gluing and resmoothing theorem. We also demonstrate how one calculates amplitudes in the half-string approach to closed string field theory, by working out explicitly a few simple three-amplitudes.