Related papers: Resultant-based Elimination in Ore Algebra
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…
We present formulas for the homogenous multivariate resultant as a quotient of two determinants. They extend classical Macaulay formulas, and involve matrices of considerably smaller size, whose non zero entries include coefficients of the…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
For a bilinear form obtained by adding a Dirac mass to a positive definite moment functional in several variables, explicit formulas of orthogonal polynomials are derived from the orthogonal polynomials associated with the moment…
We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…
We investigate and derive second solutions to linear homogeneous second-order difference equations using a variety of methods, in each case going beyond the purely formal solution and giving explicit expressions for the second solution. We…
In this paper, we solve the problem of computing the inverse in Clifford algebras of arbitrary dimension. We present basis-free formulas of different types (explicit and recursive) for the determinant, other characteristic polynomial…
Invariant sets are a key ingredient for verifying safety and other properties of cyber-physical systems that mix discrete and continuous dynamics. We adapt the elimination-theoretic Rosenfeld-Gr\"{o}bner algorithm to systematically obtain…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
In this work, we propose a new approach called ``stationary reduction method based on nonisospectral deformation of orthogonal polynomials" for deriving discrete Painlev\'{e}-type (d-P-type) equations. We apply this approach to…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…
The solution of systems of non-autonomous linear ordinary differential equations is crucial in a variety of applications, such us nuclear magnetic resonance spectroscopy. A new method with spectral accuracy has been recently introduced in…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We systematically introduce the idea of applying differential operator method to find a particular solution of an ordinary nonhomogeneous linear differential equation with constant coefficients when the nonhomogeneous term is a polynomial…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
In this work we deduce explicit formulae for the elements of the matrices that represent the action of integro-differential operators over the coefficients of generalized Fourier series. Our formulae are obtained by performing operations on…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
In this work, we investigate a model order reduction scheme for polynomial parametric systems. We begin with defining the generalized multivariate transfer functions for the system. Based on this, we aim at constructing a reduced-order…
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…