24,820 research outputs found

    Pure connection formalism for gravity: Recursion relations

    Get PDF
    In the gauge-theoretic formulation of gravity the cubic vertex becomes simple enough for some graviton scattering amplitudes to be computed using Berends-Giele-type recursion relations. We present such a computation for the current with all same helicity on-shell gravitons. Once the recursion relation is set up and low graviton number cases are worked out, a natural guess for the solution in terms of a sum over trees presents itself readily. The solution can also be described either in terms of the half-soft function familiar from the 1998 paper by Bern, Dixon, Perelstein and Rozowsky or as a matrix determinant similar to one used by Hodges for MHV graviton amplitudes. This solution also immediate suggests the correct guess for the MHV graviton amplitude formula, as is contained in the already mentioned 1998 paper. We also obtain the recursion relation for the off-shell current with all but one same helicity gravitons.Comment: 13 pages, no figure

    MATAD: a program package for the computation of MAssive TADpoles

    Get PDF
    In the recent years there has been an enormous development in the evaluation of higher order quantum corrections. An essential ingredient in the practical calculations is provided by vacuum diagrams, i.e. integrals without external momenta. In this paper a program package is described which can deal with one-, two- and three-loop vacuum integrals with one non-zero mass parameter. The principle structure is introduced and the main parts of the package are described in detail. Explicit examples demonstrate the fields of application.Comment: 37 pages, to be published in Comp. Phys. Commu

    Dynamically Driven Renormalization Group

    Full text link
    We present a detailed discussion of a novel dynamical renormalization group scheme: the Dynamically Driven Renormalization Group (DDRG). This is a general renormalization method developed for dynamical systems with non-equilibrium critical steady-state. The method is based on a real space renormalization scheme driven by a dynamical steady-state condition which acts as a feedback on the transformation equations. This approach has been applied to open non-linear systems such as self-organized critical phenomena, and it allows the analytical evaluation of scaling dimensions and critical exponents. Equilibrium models at the critical point can also be considered. The explicit application to some models and the corresponding results are discussed.Comment: Revised version, 50 LaTex pages, 6 postscript figure

    Pomerons and BCFW recursion relations for strings on D-branes

    Full text link
    We derive pomeron vertex operators for bosonic strings and superstrings in the presence of D-branes. We demonstrate how they can be used in order to compute the Regge behavior of string amplitudes on D-branes and the amplitude of ultrarelativistic D-brane scattering. After a lightning review of the BCFW method, we proceed in a classification of the various BCFW shifts possible in a field/string theory in the presence of defects/D-branes. The BCFW shifts present several novel features, such as the possibility of performing single particle momentum shifts, due to the breaking of momentum conservation in the directions normal to the defect. Using the pomeron vertices we show that superstring amplitudes on the disc involving both open and closed strings should obey BCFW recursion relations. As a particular example, we analyze explicitly the case of 1 -> 1 scattering of level one closed string states off a D-brane. Finally, we investigate whether the eikonal Regge regime conjecture holds in the presence of D-branes.Comment: 49 pages; v2 corrected references and minor typos; v3 minor typos corrected, version to appear in NP

    On the first k moments of the random count of a pattern in a multi-states sequence generated by a Markov source

    Get PDF
    In this paper, we develop an explicit formula allowing to compute the first k moments of the random count of a pattern in a multi-states sequence generated by a Markov source. We derive efficient algorithms allowing to deal both with low or high complexity patterns and either homogeneous or heterogenous Markov models. We then apply these results to the distribution of DNA patterns in genomic sequences where we show that moment-based developments (namely: Edgeworth's expansion and Gram-Charlier type B series) allow to improve the reliability of common asymptotic approximations like Gaussian or Poisson approximations
    • …
    corecore