In addition to the mathematical advances detailed in other sections, Maple 2018 also includes improvements across many other areas of the mathematics engine.

**Integration**

The int command has seen improvements to various methods. The following new results come from the asymptotic method:

This new result results from an improvement in the elliptic integration code:

The next two examples are due to improvements to the Risch algorithm:

This previously unsolved example is due to an improvement in the hyperexponential algorithm:

**Simplification**

The simplify command has been enhanced with respect to logarithms whose arguments are constant radical expressions. Some examples:

simplify can now recognize more trig and exp simplifications:

simplify now tries harder to simplify constants that appear as subexpressions:

**PolynomialTools**

Two new commands, Homogenize and IsHomogeneous, for performing and testing (weighted) homogenization were added to the PolynomialTools package.

**Summation**

The sum command with the **parametric** option has been improved for the case of hypergeometric sums with more than one parameter. The following sums used to return unevaluated in Maple 2017.

**Sturm Sequences**

The commands sturm and sturmseq have been extended to support polynomials with real algebraic number coefficients.

**signum**

The signum command has had various improvements made. The following examples previously returned with unevaluated signum calls:

**is, coulditbe**

The is and coulditbe commands have had various improvements made. is performs more simplification than it did previously:

and takes into account more function properties:

and operation properties:

The internal solver for systems of inequalities in is and coulditbe has been improved:

**Re, Im**

The Re and Im commands have had various improvements made. The following examples previously returned with unevaluated Re and Im calls:

**max, min**

In some cases, the max and min commands can now recognize numbers as real even though they are composed from nonreal ingredients:

**arctan**

The arctan command now performs some more automatic simplifications:

Furthermore, combine performs more simplifications on arctan functions:

**SMTLIB**

The SMTLIB package has been extended to support satisfiability queries on Boolean combinations of polynomial equations and inequalities.

Consider the following description of a set: We can use first use SMTLIB[Satisfiable] to verify that a solution exists:

In this simple two-dimensional case, we can use plots[inequal] to visualize the solution space:

The new command SMTLIB[Satisfy] offers an efficient method of finding a concrete example for a point in the solution space:

To produce a satisfying point within the visual bounds of the plot above, we can simply augment our system with a bounding rectangle:

**Generalized polylogarithms**

The GeneralizedPolylog, MultiPolylog and MultiZeta functions have been added to the Maple library, as part of on-going work in the area of mathematical functions.

Generalized polylogarithms [1, 2] (also known as Goncharov polylogarithms, generalized harmonic polylogarithms, or hyperlogarithms) are a class of functions that frequently show up in results for Feynman integrals, as they appear in high energy physics (for overview articles, see e.g. refs. [3, 4]). Therefore tools for their manipulation and evaluation are of high importance for precise predictions in high energy particle scattering processes, as they take place for instance at the Large Hadron Collider at CERN.

Generalized polylogarithms are also a generalization of functions such as the logarithm, the classical (or Euler) polylogarithm, and the harmonic polylogarithm [5], which all appear as special cases.

When evaluated at certain special values, generalized polylogarithms reduce to a set of numbers called multiple zeta values [6, 7, 8], which are a generalization of the values of the Riemann zeta function evaluated at positive integers. Aside form their appearance in physics, these numbers are also of interest in pure mathematics such as number theory.

The generalized polylogarithm is defined recursively, as the iterated integral

The recursion stops, as

For all the indices being zero, an alternative definition is used, as

The multiple polylogarithm, on the other hand, represent the sum form over

and the analytic continuation thereof outside its convergent region, which is given by the restrictions

__MultiZeta__
is an implementation of multiple zeta values, also known as the generalized Euler sums over

The sum converges for all positive integer arguments, except when the first argument equals one, for instance as in , in which case the function diverges.

To display special functions using textbook notation, use extended typesetting and enable the typesetting of mathematical functions.

> |

Functions such as ln, polylog and MultiZeta may appear as special cases of the generalized polylogarithms

> |

> |

Likewise, and using a more compact input syntax

> |

The Multiple Polylogarithm has been implemented for certain special values such as the oscillating multiple Zeta values up to weight four

> |

and also for certain cases at weights two an three where it reduces directly to classical polylogarithms

> |

Similar relations are implemented for the generalized polylogarithm

> |

Many relations are obeyed by the generalized polylogarithm, such as the rescaling relation

> |

> |

Evaluate numerically and up to 8 digits

> |

and the shuffle relation

> |

> |

Up to 6 digits,

> |

and the "stuffle" relation

> |

> |

> |

For one argument, **MultiZeta** reduces to the Riemann __Zeta__
function:

> |

The more relevant special cases are computed automatically, such as that of two identical arguments, here using a more compact input syntax

> |

and of two arguments summing to an odd number

> |

All Multiple Zeta values of weight less than or equal to seven, can be written solely in terms of classical __Zeta__
values:

> |

The multiple Zeta values are a special case of the the multiple polylogarithm:

> |

The multiple zeta values obey a large number of identities, primarily the stuffle relation:

> |

> |

Up to 5 digits,

> |

and the duality

> |

> |

> |

References

[1] A. B. Goncharov, **Multiple polylogarithms, cyclotomy and modular complexes**, Math.Res.Lett. 5 (1998) 497 516. arXiv:1105.2076, doi:10.4310/MRL.1998.v5.n4.a7.

[2] A. B. Goncharov, M. Spradlin, C. Vergu, A. Volovich, **Classical Polylogarithms for Amplitudes and Wilson Loops**, Phys. Rev. Lett. 105 (2010) 151605. arXiv:1006.5703, doi:10.1103/PhysRevLett.105.151605.

[3] J. M. Henn, **Lectures on differential equations for Feynman integrals**, J. Phys. A48 (2015) 153001. arXiv:1412.2296, doi:10.1088/1751- 8113/48/15/153001.

[4] C. Duhr, **Mathematical aspects of scattering amplitudes**, in: Theoretical Advanced Study Institute in Elementary Particle Physics: Journeys Through the Precision Frontier: Amplitudes for Colliders (TASI 2014) Boulder, Colorado, June 2-27, 2014, 2014. arXiv:1411.753