26 research outputs found

    Functional relations for elliptic polylogarithms

    Get PDF
    Numerous examples of functional relations for multiple polylogarithms are known. For elliptic polylogarithms, however, tools for the exploration of functional relations are available, but only very few relations are identified. Starting from an approach of Zagier and Gangl, which in turn is based on considerations about an elliptic version of the Bloch group, we explore functional relations between elliptic polylogarithms and link them to the relations which can be derived using the elliptic symbol formalism. The elliptic symbol formalism in turn allows for an alternative proof of the validity of the elliptic Bloch relation. While the five-term identity is the prime example of a functional identity for multiple polylogarithms and implies many dilogarithm identities, the situation in the elliptic setup is more involved: there is no simple elliptic analogue, but rather a whole class of elliptic identities

    R^4 counterterm and E7(7) symmetry in maximal supergravity

    Get PDF
    The coefficient of a potential R^4 counterterm in N=8 supergravity has been shown previously to vanish in an explicit three-loop calculation. The R^4 term respects N=8 supersymmetry; hence this result poses the question of whether another symmetry could be responsible for the cancellation of the three-loop divergence. In this article we investigate possible restrictions from the coset symmetry E7(7)/SU(8), exploring the limits as a single scalar becomes soft, as well as a double-soft scalar limit relation derived recently by Arkani-Hamed et al. We implement these relations for the matrix elements of the R^4 term that occurs in the low-energy expansion of closed-string tree-level amplitudes. We find that the matrix elements of R^4 that we investigated all obey the double-soft scalar limit relation, including certain non-maximally-helicity-violating six-point amplitudes. However, the single-soft limit does not vanish for this latter set of amplitudes, which suggests that the E7(7) symmetry is broken by the R^4 term.Comment: 33 pages, typos corrected, published versio

    Pathways to cellular supremacy in biocomputing

    Get PDF
    Synthetic biology uses living cells as the substrate for performing human-defined computations. Many current implementations of cellular computing are based on the “genetic circuit” metaphor, an approximation of the operation of silicon-based computers. Although this conceptual mapping has been relatively successful, we argue that it fundamentally limits the types of computation that may be engineered inside the cell, and fails to exploit the rich and diverse functionality available in natural living systems. We propose the notion of “cellular supremacy” to focus attention on domains in which biocomputing might offer superior performance over traditional computers. We consider potential pathways toward cellular supremacy, and suggest application areas in which it may be found.A.G.-M. was supported by the SynBio3D project of the UK Engineering and Physical Sciences Research Council (EP/R019002/1) and the European CSA on biological standardization BIOROBOOST (EU grant number 820699). T.E.G. was supported by a Royal Society University Research Fellowship (grant UF160357) and BrisSynBio, a BBSRC/ EPSRC Synthetic Biology Research Centre (grant BB/L01386X/1). P.Z. was supported by the EPSRC Portabolomics project (grant EP/N031962/1). P.C. was supported by SynBioChem, a BBSRC/EPSRC Centre for Synthetic Biology of Fine and Specialty Chemicals (grant BB/M017702/1) and the ShikiFactory100 project of the European Union’s Horizon 2020 research and innovation programme under grant agreement 814408
    corecore