cltd - cLTD with mathematica front end

A Mathematica package that allows computing the cLTD expression using FROM.

• Supports general expression with arbitrary numerators.
• Support of multi-core using tform with the number of cores specified with the FORMcores option.
• Allows optimizing the run for when no numerator is present through the NoNumerator option.
• Allows the generation of the standard LTD expression with the stdLTD option.

The proof and implementation of the algorithm can be found in the at Manifestly Causal Loop-Tree Duality.

NEW

The package also offers to generate the cLTD expression directly from a Mathematica directed graph. - The Graph representation can then by used to generate the (c)LTD expression with GeneratecLTDExpression with options similar to cLTD and can be seen using SetOptions[GeneratecLTDExpression] - Different LTD representation whose E-surface denominator all correspond to cross-free families of subsets of the graph vertices by calling CrossFreeFamilyLTD from the same graph representation

The reference Threshold singularity structure of Feynman diagrams from triangulations of convex cones will appear soon.

More details on the usage can be found in the README file.

- Mathematica
Published by apelloni over 3 years ago

cltd - cLTD with mathematica front end

A Mathematica package that allows computing the cLTD expression using FROM.

• Supports general expression with arbitrary numerators.
• Support of multi-core using tform with the number of cores specified with the FORMcores option.
• Allows optimizing the run for when no numerator is present through the NoNumerator option.
• Allows the generation of the standard LTD expression with the stdLTD option.

The proof and implementation of the algorithm can be found in the at Manifestly Causal Loop-Tree Duality.

- Mathematica
Published by apelloni over 3 years ago

cltd - cLTD mathematica front end

A Mathematica package that allows computing the cLTD expression using FROM.

• Supports general expression with arbitrary numerators.
• Support of multi-core using tform with the number of cores specified with the FORMcores option.
• Allows optimizing the run for when no numerator is present through the NoNumerator option.

The proof and implementation of the algorithm can be found in the at Manifestly Causal Loop-Tree Duality.

- Mathematica
Published by apelloni almost 5 years ago