FORM, Diagrams and Topologies

Amsterdam); Andreas Vogt (Liverpool U.; Ben Ruijl; Dept. Math.); Franz Herzog; J.A.M. Vermaseren (NIKHEF; Takahiro Ueda

REVIEW

FORM, Diagrams and Topologies

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1608.01834 v1 pith:TXPV37YK submitted 2016-08-05 hep-ph

Franz Herzog , Ben Ruijl , Takahiro Ueda , J.A.M. Vermaseren (NIKHEF , Amsterdam) , Andreas Vogt (Liverpool U. , Dept. Math.) This is my paper

classification hep-ph

keywords diagramsfeaturesformautomaticdiscussessentialforcerlarge

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We discuss a number of FORM features that are essential in the automatic processing of very large numbers of diagrams as used in the Forcer program for 4-loop massless propagator diagrams. Most of these features are new.

Discussion (0). Sign in to comment.

Pith tools