Related papers: Recursive generation of one-loop amplitudes in the…
We tackle the problem of generating code snippets from natural language descriptions using the CoNaLa dataset. We use the self-attention based transformer architecture and show that it performs better than recurrent attention-based encoder…
In models to generate program source code from natural language, representing this code in a tree structure has been a common approach. However, existing methods often fail to generate complex code correctly due to a lack of ability to…
Cellular Automata (CA) are an interesting computational model for designing Pseudorandom Number Generators (PRNG), due to the complex dynamical behavior they can exhibit depending on the underlying local rule. Most of the CA-based PRNGs…
We establish an efficient polynomial-complexity algorithm for one-loop calculations, based on generalized $D$-dimensional unitarity. It allows automated computations of both cut-constructible {\it and} rational parts of one-loop scattering…
The recursive calculation of Selberg integrals by Aomoto and Terasoma using the Knizhnik-Zamolodchikov equation and the Drinfeld associator makes use of an auxiliary point and facilitates the recursive evaluation of string amplitudes at…
We suggest a new approach for the automatic and fully numerical evaluation of one-loop scattering amplitudes in perturbative quantum field theory. We use suitably formulated dispersion relations to perform the calculation as a convolution…
We construct the COpula Recursive Tree (CORT) estimator: a flexible, consistent, piecewise linear estimator of a copula, leveraging the patchwork copula formalization and various piecewise constant density estimators. While the patchwork…
We study string corrections to one-loop amplitudes of single-particle operators ${\cal O}_p$ in $AdS_5 \times S^5$. The tree-level correlators in supergravity enjoy an accidental 10d conformal symmetry. Consequently, one observes a partial…
We provide a new set of on-shell recursion relations for tree-level scattering amplitudes, which are valid for any non-trivial theory of massless particles. In particular, we reconstruct the scattering amplitudes from (a subset of) their…
We present a numerical implementation for virtual corrections to multi-jet production at Next-to-Leading order. Using the algorithm of generalised unitarity we compute primitive amplitudes from tree-level input. These basic ingredients are…
We investigate relations between loop and tree amplitudes in quantum field theory that involve putting on-shell some loop propagators. This generalizes the so-called Feynman tree theorem which is satisfied at 1-loop. Exploiting retarded…
Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function. The synthesis and validation of a reversible circuit simulating a given function…
In this letter we discuss a regularization scheme for the integration of generic on-shell forms. The basic idea is to extend the three-particle amplitudes to the space of unphysical helicities keeping the dimension of the related coupling…
A natural approach to software quality assurance consists in writing unit tests securing programmer-declared code invariants. Throughout the literature a great body of work has been devoted to tools and techniques automating this…
We derive the N-point one-loop correlation functions for the currents of an arbitrary affine Kac-Moody algebra. The one-loop amplitudes, which are elliptic functions defined on the torus Riemann surface, are specified by group invariant…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
We elucidate the structure of the next-to-leading-power soft-gluon expansion of arbitrary one-loop massless-QCD amplitudes. The expansion is given in terms of universal colour-, spin- and flavour-dependent operators acting on…
We model the recursive production property of context-free grammars for natural and synthetic languages. To this end, we present a dynamic programming algorithm that marginalises over latent binary tree structures with $N$ leaves, allowing…
Random linear network coding (RLNC) in theory achieves the max-flow capacity of multicast networks, at the cost of high decoding complexity. To improve the performance-complexity tradeoff, we consider the design of sparse network codes. A…