D’Alembertian series solutions at ordinary points of LODE with polynomial coefficients
نویسندگان
چکیده
منابع مشابه
D'Alembertian series solutions at ordinary points of LODE with polynomial coefficients
By definition, the coefficient sequence c = (cn) of a d’Alembertian series — Taylor’s or Laurent’s — satisfies a linear recurrence equation with coefficients in C(n) and the corresponding recurrence operator can be factored into first order factors over C(n) (if this operator is of order 1, then the series is hypergeometric). Let L be a linear differential operator with polynomial coefficients....
متن کاملPuiseux Series Solutions of Ordinary Polynomial Differential Equations : Complexity Study
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given in 1990 by Grigoriev for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for arbitrary differential polynomials. The alg...
متن کاملEventually rational and m-sparse points of linear ordinary differential operators with polynomial coefficients
Let L(y) = 0 be a linear homogeneous ordinary di erential equation with polynomial coefcients. One of the general problems connected with such an equation is to nd all points a (ordinary or singular) and all formal power series ∑∞ n=0 cn(x − a) which satisfy L(y) = 0 and whose coe cient cn — considered as a function of n — has some ‘nice’ properties: for example, cn has an explicit representati...
متن کاملDefinite Sums as Solutions of Linear Recurrences With Polynomial Coefficients
We present an algorithm which, given a linear recurrence operator L with polynomial coefficients, m ∈ N \ {0}, a1, a2, . . . , am ∈ N \ {0} and b1, b2, . . . , bm ∈ K, returns a linear recurrence operator L ′ with rational coefficients such that for every sequence h,
متن کاملSmall solutions to systems of polynomial equations with integer coefficients
The paper discusses a series of conjectures due to A. Tyszka aiming to describe boxes in which there exists at least one solution to a system of polynomial equations with integer coefficients. A proof of the bound valid in the linear case is given. 1 Two basic questions When facing systems of equations whose solutions are hard to determine, one is satisfied to determine (or at least estimate) t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2009
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2008.04.004