Skip to content

Implementation of N3LO k-factors #6

@giacomomagni

Description

@giacomomagni

Here we sketch a TODO list of the major issues
that have to be fixed in order to produce N3LO DIS k-factors
or merge this implementation in Yadism:

  • Generalise the code such it can work for any heavy threshold for and generic nf @andreab1997
  • Update inputs from ADANI taking advantage from the work done by @niclaurenti writing a new python wrapper for his code.
  • Interface ADANI with this code @andreab1997
  • Update the x-space N3LO matching conditions (M_QG, M_Qq) using the inverting the N-space Eko implementation @giacomomagni.
  • Use the massless N3LO coefficient functions implemented in yadism, to minimise the inputs @giacomomagni
  • Implement the actual cross sections (import form yadism)
  • Parallelise the integration to make the code faster.
  • Decide the output format. There are at least 3 options: integrate the code in yadism, produce k-factors N3LO_heavy/NNLO or produce N3LO_heavy/N3LO
  • Eventually propagate the approximation uncertainty to the FK-tables
  • extend fonll in F2_M, FL_M
  • implement input format (something like pineko) @andreab1997
  • Benchmark fonll nlo/nnlo with yadism @giacomomagni
  • Benchmark massive coeff funcs against yadism @giacomomagni
  • compute all the N3LO grids F2 (tilde funcs) @giacomomagni
  • compute all the N3LO grids FL (tilde funcs) @giacomomagni

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions