Related papers: Polynomial and rational solutions of holonomic sys…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…
It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…
We have been working in many aspects of the problem of analyzing, understanding and solving ordinary differential equations (first and second order). As we have extensively mentioned, while working in the Darboux type methods, the most…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We show that any differential operator of the form $L(y)=\sum_{k=0}^{k=N} a_{k}(x) y^{(k)}$, where $a_k$ is a real polynomial of degree $\leq k$, has all real eigenvalues in the space of polynomials of degree at most n, for all n. The…
In the framework of (vector valued) quantized holomorphic functions defined on non-commutative spaces, ``quantized hermitian symmetric spaces'', we analyze what the algebras of quantized differential operators with variable coefficients…
We introduce a search algorithm that utilises differential operator realisations to find polynomial Casimir operators of Lie algebras. To demonstrate the algorithm, we look at two classes of examples: (1) the model filiform Lie algebras and…
Polynomials related to rational solutions of Painleve' equations satisfy certain difference equations. Conditions are given to acertain that all solutions really are polynomials.
We study quotients of the Weyl algebra by left ideals whose generators consist of an arbitrary Z^d-graded binomial ideal I along with Euler operators defined by the grading and a parameter in C^d. We determine the parameters for which these…
Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…
We present a new approach to determine the rational solutions of the higher order Painleve equations associated to periodic dressing chain systems. We obtain new sets of solutions, giving determinantal representations indexed by specific…
In this paper, we study the holonomic $D$-modules when $D$ is the ring of $k$-linear differential operators on $A = k[\Gamma]$, the coordinate ring of an affine monomial curve over the complex numbers $k = \mathbb C$. In particular, we…
A rational number is dyadic if it has a finite binary representation $p/2^k$, where $p$ is an integer and $k$ is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in…
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…
Let R and S be two irreducible root systems spanning the same vector space and having the same Weyl group W, such that S (but not necessarily R) is reduced. For each such pair (R,S) we construct a family of W-invariant orthogonal…
In algebraic combinatorics and formal calculation, context-free grammar is defined by a formal derivative based on a set of substitution rules. In this paper, we investigate this issue from three related viewpoints. Firstly, we introduce a…