AbstractAn algorithm is considered, and shown to lead to various unusual and unique series expansions of formal Laurent series, as the sums of reciprocals of polynomials. The degrees of approximation by the rational functions which are the partial sums of these series are investigated. The types of series corresponding to rational functions themselves are also partially characterized
AbstractA general algorithm is considered and shown to lead to various unusual and unique series exp...
AbstractLet F be an arbitrary field and let K = F((x−1)) be the field of formal Laurent series in x−...
In this paper we present a new algorithm for solving polynomial equations based on the Taylor serie...
AbstractAn algorithm is considered, and shown to lead to various unusual and unique series expansion...
AbstractLet {μk}−∞+∞ be a given double infinite sequence of complex numbers. By defining a linear fu...
AbstractAn algorithm is introduced and shown to lead to various unique series expansions of p-adic n...
Laurent Padé–Chebyshev rational approximants, A m (z,z –1)/B n (z,z –1), whose Laurent series expans...
AbstractWe study expansions in polynomials {Pn(x)}∞o generated by ∑∞n = o Pn(x)tn = A(t) φ(xtkθ(t)),...
Abstract. We construct families of non-quadratic algebraic laurent series (over finite fields of any...
AbstractIf f = Σn=−∞∞ antn is a formal Laurent series with certain restrictions on the an, then f = ...
This thesis looks at the interplay of three important domains: combinatorics on words, theory of fin...
AbstractIn the algebra of formal Laurent series, the falling factoral powers x(n) are generalized to...
In this paper we give a general upper bound for the irrationality exponent of algebraic Laurent seri...
The Laurent expansion is a well-known topic in complex analysis for its application in obtaining res...
In this paper, with different approaches we study rational approximation for the algebraic {formal p...
AbstractA general algorithm is considered and shown to lead to various unusual and unique series exp...
AbstractLet F be an arbitrary field and let K = F((x−1)) be the field of formal Laurent series in x−...
In this paper we present a new algorithm for solving polynomial equations based on the Taylor serie...
AbstractAn algorithm is considered, and shown to lead to various unusual and unique series expansion...
AbstractLet {μk}−∞+∞ be a given double infinite sequence of complex numbers. By defining a linear fu...
AbstractAn algorithm is introduced and shown to lead to various unique series expansions of p-adic n...
Laurent Padé–Chebyshev rational approximants, A m (z,z –1)/B n (z,z –1), whose Laurent series expans...
AbstractWe study expansions in polynomials {Pn(x)}∞o generated by ∑∞n = o Pn(x)tn = A(t) φ(xtkθ(t)),...
Abstract. We construct families of non-quadratic algebraic laurent series (over finite fields of any...
AbstractIf f = Σn=−∞∞ antn is a formal Laurent series with certain restrictions on the an, then f = ...
This thesis looks at the interplay of three important domains: combinatorics on words, theory of fin...
AbstractIn the algebra of formal Laurent series, the falling factoral powers x(n) are generalized to...
In this paper we give a general upper bound for the irrationality exponent of algebraic Laurent seri...
The Laurent expansion is a well-known topic in complex analysis for its application in obtaining res...
In this paper, with different approaches we study rational approximation for the algebraic {formal p...
AbstractA general algorithm is considered and shown to lead to various unusual and unique series exp...
AbstractLet F be an arbitrary field and let K = F((x−1)) be the field of formal Laurent series in x−...
In this paper we present a new algorithm for solving polynomial equations based on the Taylor serie...