Related papers: Matrix-Element Corrections to Parton Shower Algori…
In these proceedings we present three possible interpretations of the ordering variable implemented in the Herwig7 angular-ordered parton shower. Each interpretation determines a different recoil-scheme prescription and we show how it can…
We summarize recent developments in the VINCIA parton shower. After a brief review of the basics of the formalism, the extension of VINCIA to hadron collisions is sketched. We then turn to improvements of the efficiency of tree-level…
We present a complete formalism for final-state (timelike) dipole-antenna showers including fermion masses, but neglecting polarization and finite-width effects. We make several comparisons of tree-level expansions of this shower algorithm…
We study the mismatch between a full calculation of non-global single-logarithms in the large-N_c limit and an approximation based on free azimuthal averaging, and the consequent angular-ordered pattern of soft gluon radiation in QCD. We…
Fracton topological phases have a large number of materialized symmetries that enforce a rigid structure on their excitations. Remarkably, we find that the symmetries of a quantum error-correcting code based on a fracton phase enable us to…
The alternating least squares algorithm for CP and Tucker decomposition is dominated in cost by the tensor contractions necessary to set up the quadratic optimization subproblems. We introduce a novel family of algorithms that uses…
We investigate the effects of combining next-to-leading order QCD results with parton-shower effects in $W^+W^-jj$ production via vector-boson fusion including leptonic decays. Using the Herwig 7 framework interfaced to VBFNLO 3, we compare…
We present a method to match the multi-parton states generated by the High Energy Jets Monte Carlo with parton showers generated by the Ariadne program using the colour dipole model. The High Energy Jets program already includes a full…
In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition…
We report on the possibility of reweighting parton-shower Monte Carlo predictions for scale variations in the parton-shower algorithm. The method is based on a generalization of the Sudakov veto algorithm. We demonstrate the feasibility of…
We present a general method to match fully differential next-to-next-to-leading (NNLO) calculations to parton shower programs. We discuss in detail the perturbative accuracy criteria a complete NNLO+PS matching has to satisfy. Our method is…
We present an improved Metropolis algorithm for arbitrary hard core systems in any dimensions. In the new updating scheme the conventional Metropolis step of a single particle is replaced by a collective step of a chain of particles. For…
In this paper, we study first-order methods on a large variety of low-rank matrix optimization problems, whose solutions only live in a low dimensional eigenspace. Traditional first-order methods depend on the eigenvalue decomposition at…
In this work we present a new subtraction method for next-to-leading order calculations that is particularly convenient even when narrow resonances are present. The method is particularly suitable for the implementation of next-to-leading…
We present a method for obtaining an initial-state parton shower model where the (backward) evolution fully consistent with the (forward) evolution of the collinear parton density used. As a proof-of-concept we use parton densities obtained…
The Matrix Element Method is a promising multi-variate analysis tool which offers an optimal approach to compare theory and experiment according to the Neyman-Pearson lemma. However, until recently its usage has been limited by the fact…
In this article, we establish a class of new projected type iteration methods based on matrix spitting for solving the linear complementarity problem. Also, we provide a sufficient condition for the convergence analysis when the system…
In this talk, we discuss recent developments in combining parton showers and fixed-order calculations. We focus on the UNNLOPS method for matching next-to-next-to-leading order computations to the parton shower, and we present results from…
The Single Instruction, Multiple Thread (SIMT) paradigm of GPU programming does not support the branching nature of a parton shower algorithm by definition. However, modern GPUs are designed to schedule threads with diverging processes…
We study the matching of multijet matrix elements and shower evolution in the case of top production in hadronic collisions at the Tevatron and at the LHC. We present the results of the matching algorithm implemented in the ALPGEN Monte…