Related papers: An Efficient Method for Computing Liouvillian Firs…
In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…
In this paper, we establish a priori estimates for the positive solutions to a higher-order fractional Laplace equation on a bounded domain by a blowing-up and rescaling argument. To overcome the technical difficulty due to the high-order…
We present algebraic construction of Darboux matrices for 1+1-dimensional integrable systems of nonlinear partial differential equations with a special stress on the nonisospectral case. We discuss different approaches to the…
Integration operational matrix methods based on Zernike polynomials are used to determine approximate solutions of a class of non-homogeneous partial differential equations (PDEs) of first and second order. Due to the nature of the Zernike…
Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial or rational ODE system with specified outputs. A basic symbolic approach to analyze…
In many nonlinear field theories, relevant solutions may be found by reducing the order of the original Euler-Lagrange equations, e.g., to first order equations (Bogomolnyi equations, self-duality equations, etc.). Here we generalise,…
We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations. For an autonomous first-order algebraic ordinary difference equations, we give an upper bound for the degrees…
We adapt the notion of the Darboux transformation to the context of polynomial Sturm-Liouville problems. As an application, we characterize the recently described $X_m$ Laguerre polynomials in terms of an isospectral Darboux transformation.…
The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ...,…
We study first-order methods with preconditioning for solving structured nonlinear convex optimization problems. We propose a new family of preconditioners generated by symmetric polynomials. They provide first-order optimization methods…
A set of MapleV R5 software routines for solving first order ordinary differential equations (1ODEs) is presented. The package implements the Prelle-Singer Method in its original form plus its extension to include elementary functions…
We study the integrability of polynomial vector fields using Galois theory of linear differential equations when the associated foliations is reduced to a Riccati type foliation. In particular we obtain integrability results for some…
This work investigates a new approach to find closed form analytical approximate solution of linear initial value problems. Classical Bernoulli polynomials have been used to derive a finite set of orthonormal polynomials and a finite…
We show how all the quantal systems related to the exceptional Laguerre and Jacobi polynomials can be constructed in a direct and systematic way, without the need of shape invariance and Darboux-Crum transformation. Furthermore, the…
In this paper the Feynman path integral technique is applied to two-dimensional spaces of non-constant curvature: these spaces are called Darboux spaces $\DI$--$\DIV$. We start each consideration in terms of the metric and then analyze the…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
We investigate the integrability of polynomial vector fields through the lens of duality in parameter spaces. We examine formal power series solutions annihilated by differential operators and explore the properties of the integrability…
We present a method to decompose a set of multivariate real polynomials into linear combinations of univariate polynomials in linear forms of the input variables. The method proceeds by collecting the first-order information of the…