The density theorem of Schlesinger ensures that the monodromy group of a differential system with regular singular points is Zariski-dense in its differential Galois group. We have analogs of this result for difference systems such as q-difference and Mahler systems, whose only assumption is the regular singular condition. Moreover, solutions of difference or differential systems with regular singularities have good analytical properties. For example, the solutions of differential systems which are regular singular at 0 have moderate growth at 0. We have general algorithms for recognizing regular singularities and they apply to many systems such as differential and q-difference systems. However, they do not apply to the Mahler case, systems that appear in many areas like automata theory. We will explain how to recognize regular singularities of Mahler systems. It is a joint work with Colin Faverjon.[-]

The mini-course is structured into three parts. In the first part, we provide a general overview of the tools available in the summation package Sigma, with a particular focus on parameterized telescoping (which includes Zeilberger's creative telescoping as a special case) and recurrence solving for the class of indefinite nested sums defined over nested products. The second part delves into the core concepts of the underlying difference ring theory, offering detailed insights into the algorithmic framework. Special attention is given to the representation of indefinite nested sums and products within the difference ring setting. As a bonus, we obtain a toolbox that facilitates the construction of summation objects whose sequences are algebraically independent of one another. In the third part, we demonstrate how this summation toolbox can be applied to tackle complex problems arising in enumerative combinatorics, number theory, and elementary particle physics.[-]

The mini-course is structured into three parts. In the first part, we provide a general overview of the tools available in the summation package Sigma, with a particular focus on parameterized telescoping (which includes Zeilberger's creative telescoping as a special case) and recurrence solving for the class of indefinite nested sums defined over nested products. The second part delves into the core concepts of the underlying difference ring theory, offering detailed insights into the algorithmic framework. Special attention is given to the representation of indefinite nested sums and products within the difference ring setting. As a bonus, we obtain a toolbox that facilitates the construction of summation objects whose sequences are algebraically independent of one another. In the third part, we demonstrate how this summation toolbox can be applied to tackle complex problems arising in enumerative combinatorics, number theory, and elementary particle physics.[-]

The mini-course is structured into three parts. In the first part, we provide a general overview of the tools available in the summation package Sigma, with a particular focus on parameterized telescoping (which includes Zeilberger's creative telescoping as a special case) and recurrence solving for the class of indefinite nested sums defined over nested products. The second part delves into the core concepts of the underlying difference ring theory, offering detailed insights into the algorithmic framework. Special attention is given to the representation of indefinite nested sums and products within the difference ring setting. As a bonus, we obtain a toolbox that facilitates the construction of summation objects whose sequences are algebraically independent of one another. In the third part, we demonstrate how this summation toolbox can be applied to tackle complex problems arising in enumerative combinatorics, number theory, and elementary particle physics.[-]

This course is dedicated to core algorithms of polyhedral geometry and covers theoretical aspects as well as practical ones. We will start with rational polyhedra, their projections and the conversions between their different types of representations. We will continue with a tour of the different questions related to the lattice points of rational polyhedra : checking existence, counting these points, describing them, in particular for the case of parametric polyhedra. Practical applications of rational polyhedra and lattice polyhedra require, at least in theory, to perform quantifier elimination, we will see how this is done in the context of optimizing compilers.[-]

Classical invariant theory has essentially addressed the action of the general linear group on homogeneous polynomials. Yet the orthogonal group arises in applications as the relevant group of transformations, especially in 3 dimensional space. Having a complete set of invariants for its action on ternary quartics, i.e. degree 4 homogeneous polynomials in 3 variables, is, for instance, relevant in determining biomarkers for white matter from diffusion MRI.
We characterize a generating set of rational invariants of the orthogonal group acting on even degree forms by their restriction on a slice. These restrictions are invariant under the octahedral group and their explicit formulae are given compactly in terms of equivariant maps. The invariants of the orthogonal group can then be obtained in an explicit way, but their numerical evaluation can be achieved more robustly using their restrictions. The exhibited set of generators futhermore allows us to solve the inverse problem and the rewriting.
Central in obtaining the invariants for higher degree forms is the preliminary construction, with explicit formulae, for a basis of harmonic polynomials with octahedral symmetry, dif- ferent, though related, to cubic harmonics.
This is joint work with Paul Görlach (now at MPI Leipzig), in a joint project with Téo Papadopoulo (Inria Méditerranée).[-]