Ehrhart polynomials and maximum parallelism

The parametric vertices finding program tells that the parametric vertices are divided in two sets of occuring vertices depending on two validity domains of the parameters values. Hence, par(n, t) is also defined on two validity domains as Ehrhart polynomials in n and t.

According to results due to Eugène Ehrhart and to our calculation method which is fully detailed in our papers and research reports, the following answers are computed:

From these results, the maximum parallelism is deduced:

Previous page: The parametric vertices