Related papers: A simple algorithm for expanding a power series as…

We provide a generalization of continued fractions to the Heisenberg group. We prove an explicit estimate on the rate of convergence of the infinite continued fraction and several surprising analogs of classical formulas about continued…

We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…

In the cryptanalysis of stream ciphers and pseudorandom sequences, the notions of linear, jump, and 2-adic complexity arise naturally to measure the (non)randomness of a given string. We define an isometry K on F_q^\infty that is the…

Using techniques introduced by D. Mayer, we prove an extension of the classical Gauss-Kuzmin theorem about the distribution of continued fractions, which in particular allows one to take into account some congruence properties of successive…

We define a new kind of classical digamma function, and establish its some fundamental identities. Then we apply the formulas obtained, and extend tools developed by Flajolet and Salvy to study more general Euler type sums. The main results…

When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…

Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…

In this article, we develop a k-free zeta Dirichlet series into a Laurent series with a simple pole, and prove a Stieltjes like formula for the expansion coefficients of the regular part. We also investigate another analytical continuation…

Fractional calculus is the calculus of differentiation and integration of non-integer orders. In a recently paper (Annals of Physics 323 (2008) 2756-2778), the Fundamental Theorem of Fractional Calculus is highlighted. Based on this…

We introduce a random dynamical system related to continued fraction expansions. It uses random combination of the Gauss map and the R\'enyi (or backwards) continued fraction map. We explore the continued fraction expansions that this…

We describe the points of diff erentiability of the multiplicative autocorrelation function of the "fractional part" function. In connection with this question, we study series involving the fi rst Bernoulli function, the arithmetical…

We are used to thinking of an operator acting once, twice, and so on. However, an operator acting integer times can be consistently analytic continued to an operator acting complex times. Applications: (s,r) diagrams and an extension of…

Let the formal power series f in d variables with coefficients in an arbitrary field be a symmetric function decomposed as a series of Schur functions, and let f be a rational function whose denominator is a product of binomials of the form…

We prove the existence of the limiting distribution for the sequence of denominators generated by continued fraction expansions with even partial quotients, which were introduced by F. Schweiger and studied also by C. Kraaikamp and A.…

We develop a continued fraction algorithm in finite extensions of $\Q_p$ generalising certain algorithms in $\Q_p$, and prove the finiteness property for certain small degree extensions. We also discuss the metrical properties of the…

In 1987 Jonathan and Peter Borwein, inspired by the works of Ramanujan, derived many efficient algorithms for computing $\pi$. We will see that by using only a formula of Gauss's and elementary algebra we are able to prove the correctness…

We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…

Given an algebraic ordinary differential equation (AODE), we propose a computational method to determine when a truncated power series can be extended to a formal power series solution. If a certain regularity condition on the given AODE or…

We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…

In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the $G_{n}^{(1)}$ transformation and Slevinsky-Safouhi formula for differentiation. In the…