Computing periods of rational integrals

A period of a rational integral is the result of integrating, with respect to one or several variables, a rational function over a closed path. This work focuses particularly on periods depending on a parameter: in this case the period under consideration satisfies a linear differential equation, the Picard-Fuchs equation. I give a reduction algorithm that extends the Griffiths-Dwork reduction and apply it to the computation of Picard-Fuchs equations. The resulting algorithm is elementary and has been successfully applied to problems that were previously out of reach.Comment: To appear in Math. comp. Supplementary material at http://pierre.lairez.fr/supp/periods

Explicit formula for the generating series of diagonal 3D rook paths

Let $a_n$ denote the number of ways in which a chess rook can move from a corner cell to the opposite corner cell of an $n \times n \times n$ three-dimensional chessboard, assuming that the piece moves closer to the goal cell at each step. We describe the computer-driven \emph{discovery and proof} of the fact that the generating series $G(x)= \sum_{n \geq 0} a_n x^n$ admits the following explicit expression in terms of a Gaussian hypergeometric function: G(x) = 1 + 6 \cdot \int_0^x \frac{\,\pFq21{1/3}{2/3}{2} {\frac{27 w(2-3w)}{(1-4w)^3}}}{(1-4w)(1-64w)} \, dw.Comment: To appear in "S\'eminaire Lotharingien de Combinatoire

Complete N-Point Superstring Disk Amplitude II. Amplitude and Hypergeometric Function Structure

Using the pure spinor formalism in part I [1] we compute the complete tree-level amplitude of N massless open strings and find a striking simple and compact form in terms of minimal building blocks: the full N-point amplitude is expressed by a sum over (N-3)! Yang-Mills partial subamplitudes each multiplying a multiple Gaussian hypergeometric function. While the former capture the space-time kinematics of the amplitude the latter encode the string effects. This result disguises a lot of structure linking aspects of gauge amplitudes as color and kinematics with properties of generalized Euler integrals. In this part II the structure of the multiple hypergeometric functions is analyzed in detail: their relations to monodromy equations, their minimal basis structure, and methods to determine their poles and transcendentality properties are proposed. Finally, a Groebner basis analysis provides independent sets of rational functions in the Euler integrals

Computing Periods of Hypersurfaces

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of period integrals to an initial value problem for ordinary differential equations of Picard-Fuchs type. In this way, the periods can be computed to extreme-precision in order to study their arithmetic properties. The initial conditions are obtained by an exact determination of the cohomology pairing on Fermat hypersurfaces with respect to a natural basis.Comment: 33 pages; Final version. Fixed typos, minor expository changes. Changed code repository lin

The massless two-loop two-point function

We consider the massless two-loop two-point function with arbitrary powers of the propagators and derive a representation, from which we can obtain the Laurent expansion to any desired order in the dimensional regularization parameter eps. As a side product, we show that in the Laurent expansion of the two-loop integral only rational numbers and multiple zeta values occur. Our method of calculation obtains the two-loop integral as a convolution product of two primitive one-loop integrals. We comment on the generalization of this product structure to higher loop integrals.Comment: 22 pages, revised version, eq. 9, 10 and 53 correcte

Multi set-point explicit model predictive control for nonlinear process systems

In this article, we introduce a novel framework for the design of multi set-point nonlinear explicit controllers for process systems engineering problems where the set-points are treated as uncertain parameters simultaneously with the initial state of the dynamical system at each sampling instance. To this end, an algorithm for a special class of multi-parametric nonlinear programming problems with uncertain parameters on the right-hand side of the constraints and the cost coefficients of the objective function is presented. The algorithm is based on computed algebra methods for symbolic manipulation that enable an analytical solution of the optimality conditions of the underlying multi-parametric nonlinear program. A notable property of the presented algorithm is the computation of exact, in general nonconvex, critical regions that results in potentially great computational savings through a reduction in the number of convex approximate critical regions

A computer algebra user interface manifesto

Many computer algebra systems have more than 1000 built-in functions, making expertise difficult. Using mock dialog boxes, this article describes a proposed interactive general-purpose wizard for organizing optional transformations and allowing easy fine grain control over the form of the result even by amateurs. This wizard integrates ideas including: * flexible subexpression selection; * complete control over the ordering of variables and commutative operands, with well-chosen defaults; * interleaving the choice of successively less main variables with applicable function choices to provide detailed control without incurring a combinatorial number of applicable alternatives at any one level; * quick applicability tests to reduce the listing of inapplicable transformations; * using an organizing principle to order the alternatives in a helpful manner; * labeling quickly-computed alternatives in dialog boxes with a preview of their results, * using ellipsis elisions if necessary or helpful; * allowing the user to retreat from a sequence of choices to explore other branches of the tree of alternatives or to return quickly to branches already visited; * allowing the user to accumulate more than one of the alternative forms; * integrating direct manipulation into the wizard; and * supporting not only the usual input-result pair mode, but also the useful alternative derivational and in situ replacement modes in a unified window.Comment: 38 pages, 12 figures, to be published in Communications in Computer Algebr

An introduction to interval-based constraint processing.

Constraint programming is often associated with solving problems over finite domains. Many applications in engineering, CAD and design, however, require solving problems over continuous (real-valued) domains. While simple constraint solvers can solve linear constraints with the inaccuracy of floating-point arithmetic, methods based on interval arithmetic allow exact (interval) solutions over a much wider range of problems. Applications of interval-based programming extend the range of solvable problems from non-linear polynomials up to those involving ordinary differential equations. In this text, we give an introduction to current approaches, methods and implementations of interval-based constraint programming and solving. Special care is taken to provide a uniform and consistent notation, since the literature in this field employs many seemingly different, but yet conceptually related, notations and terminology