Results 41 to 50 of about 228,694 (166)
The rank of a formal tree power series
A formal power series on trees is a mapping from a free algebra \(T_{\Sigma}\) into a field K; recall that \(\Sigma\) is a set of symbols of functions \(\Sigma =\Sigma_ 0\cup...\cup \Sigma_ n\cup...\) and that \(T_{\Sigma}\) (the set of trees) is defined inductively by: \(\Sigma_ 0\subset T_{\Sigma};\) if \(f\in \Sigma_ n\) and \(t_ 1,...,t_ n\in T_ ...
Bozapalidis, S., Louscou-Bozapalidou, O.
openaire +2 more sources
Bounds on coefficients of reciprocals of formal power series with rapidly decreasing coefficients
This paper studies reciprocals of formal power series whose coefficients are monotone and bounded by a geometrically decaying sequence. Explicit and applicable, optimal decay rates are provided for the coefficients of the reciprocal series in terms of ...
Kenneth S. Berenhaut +2 more
doaj +1 more source
Fast Algorithms for Manipulating Formal Power Series [PDF]
Computer Science ...
Richard P. Brent, H. T. Kung 0001
openaire +2 more sources
Let D be a Dedekind domain of characteristic zero, let K be the fraction field of D, and consider the Cauchy problem ay′ = byᵐ, y(0) = c₀, in the ring D[[x]], where a, b, c₀ ∈ D, a, b ≠ 0, and m ∈ ℕ.
Roman Skurikhin
doaj +1 more source
Recognizable formal power series on trees
Trees are a very basic object in computer science. They intervene in nearly a;ly domain, and they are studied for their own, or used to represent conveniently a given situation. There are at least three directions where investigations on trees themselves are motivated, and this for different reasons.
Berstel, Jean, Reutenauer, C.
openaire +2 more sources
The multidimensional generalization of Bauer's g-algorithm
The algorithm for the expansion of the given formal multiple power series into the corresponding multidimensional g-fraction with independent variables is constructed and the conditions of existence of such algorithm are established.
R. I. Dmytryshyn
doaj +1 more source
A Lifting Theorem for Formal Power Series [PDF]
We define a class of operations on formal power series that includes practically all operations of interest. The class is closed under composition. We prove that an operation in this class vanishes for complex numbers if and only if it vanishes for functions analytic at the origin. A variety of applications of this “lifting theorem” are discussed.
openaire +1 more source
Puiseux series solutions of ODEs
In this article, we will determine Puiseux series solutions of ordinary polynomial differential equations. We also study the binary complexity of computing such solutions.
Ali Ayad +3 more
doaj
On convergence sets of formal power series
17 ...
Ma, Daowei, Neelon, Tejinder S.
openaire +2 more sources

