Related papers: Polynomial and rational solutions of holonomic sys…
Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a $d$-dimensional system…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
We consider algebraic ordinary differential equations (AODEs) and study their polynomial and rational solutions. A sufficient condition for an AODE to have a degree bound for its polynomial solutions is presented. An AODE satisfying this…
The aim of these lectures is the study of bifurcations within holomorphic families of polynomials or rational maps by mean of ergodic and pluripotential theoretic tools.
In this paper an equation means a homogeneous linear partial differential equation in $n$ unknown functions of $m$ variables which has real or complex polynomial coefficients. The solution set consists of all $n$-tuples of real or complex…
A new algorithm is presented for computing a direct solution to a system of consistent linear equations. It produces a minimum norm particular solution, a generalized inverse (of type {124}), and a null space projection operator. In…
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…
The aim of the paper is to extend the class of generalized Weyl algebras to a larger class of rings (they are also called {\em generalized Weyl algebras}) that are determined by two ring endomorphisms rather than one as in the case of `old'…
The paper deals with the following system of nonlinear difference equations \begin{equation*} x_{n+1}=ax_{n}^{2}y_{n}+bx_{n}y_{n}^{2},\ y_{n+1}=cx_{n}^{2}y_{n}+dx_{n}y_{n}^{2},\ n\in \mathbb{N}_{0}, \end{equation*} where the initial values…
The aim of this work is to describe the equivalence relations in $\Q/\Z$ that arise as the rational lamination of polynomials with all cycles repelling. We also describe where in parameter space one can find a polynomial with all cycles…
In this paper we give simplified formulas for certain polynomials which arise in some new Titchmarsh-Weyl m-functions for the radial part of the separated Hydrogen atom on the half line and two independent programs for generating them using…
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…
We present an algorithm to construct a basis of k-th extension group of a D-module M in ring of the formal power series Ext_D^k(M,O).
Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…
How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
The polynomial algebra is a deformed SU(2) algebra. Here, we use polynomial algebra as a method to solve a series of deformed oscillators. Meanwhile, we find a series of physics systems corresponding with polynomial algebra with different…