Related papers: Carleman Linearization and Systems of Arbitrary De…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
This paper aims at reviewing and analysing the method of reflections. The latter is an iterative procedure designed to linear boundary value problems set in multiply connected domains. Being based on a decomposition of the domain boundary,…
We study a general class of recurrence relations that appear in the application of a matrix diagonalization procedure. We find general closed formula and determine analytical properties of the solutions. We finally apply these findings in…
This paper studies the problem of reconstructing binary matrices that are only accessible through few evaluations of their discrete X-rays. Such question is prominently motivated by the demand in material science for developing a tool for…
In this paper we introduce a six-parameter generalization of the four-parameter three-variable polynomials on the simplex and we investigate the properties of these polynomials. Sparse recurrence relations are derived by using ladder…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
This paper develops matrix-multiplication-based iterative refinement for diagonalizable non-Hermitian eigendecompositions. The main theory concerns simple eigenvalues and distinguishes two input regimes. In the right-only regime, where only…
Ab initio predictions of two-loop electroweak contributions to observables are increasingly essential for precision collider experiments, yet their evaluation remains very challenging. We connect recurrence techniques and dispersive method…
We use the implicitization procedure to generate polynomial equality constraints on the set of distributions induced by local interventions on variables governed by a causal Bayesian network with hidden variables. We show how we may reduce…
Motivated by the effective impact of the Pascal functional and the Wronskian matrices, we investigate several identities and differential equation for the Sheffer-Appell polynomial sequence by using matrix algebra. The matrix approach,…
We develop a pivot-shifted Carleman linearization framework for quantum algorithms solving quadratic nonlinear ordinary differential equations. By shifting the dynamics by a pivot state prior to Carleman lifting, and combining this with a…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
The pooling problem is a classical NP-hard problem in the chemical process and petroleum industries. This problem is modeled as a nonlinear, nonconvex network flow problem in which raw materials with different specifications are blended in…
The Paterson--Stockmeyer method is an evaluation scheme for matrix polynomials with scalar coefficients that arise in many state-of-the-art algorithms based on polynomial or rational approximation, for example, those for computing…
In this paper we propose a unified approach to matrix representations of different types of Appell polynomials. This approach is based on the creation matrix - a special matrix which has only the natural numbers as entries and is closely…
We tackle the regularisation of a differential system related to generalised Krawtchouk polynomials. We show a straightforward connection between certain auxiliary quantities involving the recurrence coefficients of these polynomials and…
We present in detail two resummation methods emerging from the application of the Simplified Differential Equations approach to a canonical basis of master integrals. The first one is a method which allows for an easy determination of the…
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we…
Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear recurrence relations of a sequence with the Berlekamp-Massey…
In recent years, there has been significant progress in the theory of orthogonal polynomials on algebraic curves, particularly on genus 1 surfaces. In this paper, we focus on elliptic orthogonal polynomials and establish several of their…