Related papers: Well-Conditioned Polynomial Representations for Ma…

Recently we have started a program to describe the action of Lie algebras associated with Dynkin-type diagrams on generic Verma modules in terms of polynomial vector fields. In this paper we explain that the results for the classical ABCD…

For a pair of polynomials with real or complex coefficients, given in any particular basis, the problem of finding their GCD is known to be ill-posed. An answer is still desired for many applications, however. Hence, looking for a GCD of…

Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices…

This work aims to accelerate the convergence of proximal gradient methods used to solve regularized linear inverse problems. This is achieved by designing a polynomial-based preconditioner that targets the eigenvalue spectrum of the normal…

With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…

The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…

Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

A novel algorithm for creating a mathematical model of curved shapes is introduced. The core of the algorithm is based on building a graph representation of the contoured image, which occupies less storage space than produced by raster…

This note addresses the signed-digit representation of nonnegative binary integers. Popular literature methods for the conversion into the canonical signed-digit representation are reviewed and revisited. A method based on string…

Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…

In this paper we give an insight into the behaviour of signature-based Gr\"obner basis algorithms, like F5, G2V or SB, for inhomogeneous input. On the one hand, it seems that the restriction to sig-safe reductions puts a penalty on the…

This paper extends characterizations of Sobolev spaces by Bourgain, Br\'{e}zis, and Mironescu to the higher order case. As a byproduct, we obtain an integral condition for the Taylor remainder term, which implies that the function is a…

In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…

A piecewise Chebyshevian spline space is good for design when it possesses a B-spline basis and this property is preserved under knot insertion. The interest in such kind of spaces is justified by the fact that, similarly as for polynomial…

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…

We show that the implicit equation of a surface in 3-dimensional projective space parametrized by bi-homogeneous polynomials of bi-degree (d,d), for a given positive integer d, can be represented and computed from the linear syzygies of its…