Interpolation is a prime tool in algebraic computation while symmetry is a qualitative feature
that can be more relevant to a mathematical model than the numerical accuracy of the …

In this paper, we tackle the following problem: compute the gcd for several univariate
polynomials with parametric coefficients. It amounts to partitioning the parameter space …

Subresultant of two univariate polynomials is a fundamental object in computational algebra
and geometry with many applications (for instance, parametric GCD and parametric …

Certain foams and relations on them are introduced to interpret functors and natural
transformations in categories of representations of iterated wreath products of cyclic groups …

Multivariate Lagrange and Hermite interpolation are examples of ideal interpolation. More
generally an ideal interpolation problem is defined by a set of linear forms, on the …

We provide explicit formulae for the coefficients of the order-d polynomial subresultant of (x−
α) m and (x− β) n with respect to the set of Bernstein polynomials {(x− α) j (x− β) d− j, 0≤ j≤ …

Subresultants of two univariate polynomials are one of the most classic and ubiquitous
objects in computational algebra and algebraic geometry. In 1948, Habicht discovered and …

The article addresses multivariate interpolation in the presence of symmetry. Interpolation is
a prime tool in algebraic computation while symmetry is a qualitative feature that can be …

An interpolation problem is defined by a set of linear forms on the (multivariate) polynomial
ring and values to be achieved by an interpolant. For Lagrange interpolation the linear forms …

The classes of sums of arithmetic-geometric exponentials (SAGE) and of sums of
nonnegative circuit polynomials (SONC) provide nonnegativity certificates which are based …