Related papers: Convergence conditions for $p$--adic continued fra…
We construct continued fraction expansions for several families of the Laurent series in $\mathbb{Q}[[t^{-1}]]$. To the best of the author's knowledge, this is the first result of this kind since Gauss derived the continued fraction…
For large $N$, we consider the ordinary continued fraction of $x=p/q$ with $1\le p\le q\le N$, or, equivalently, Euclid's gcd algorithm for two integers $1\le p\le q\le N$, putting the uniform distribution on the set of $p$ and $q$s. We…
In this paper we give sufficient conditions on the approximating domains in order to obtain the continuity of solutions for the fractional $p-$laplacian. These conditions are given in terms of the fractional capacity of the approximating…
In this paper, we first study convergence rates in the law of large numbers for independent and identically distributed random variables. We obtain a strong $L^p$-convergence version and a strongly almost sure convergence version of the law…
Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.
Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal…
We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…
In this paper, we establish sufficient conditions on the elements of the p-adic continued fractions $A$ and $B$ which guarantee that the p-adic continued fractions $A, B $ and $A^{B}$ are algebraically independent over $\mathbb{Q}$. These…
A well known method for convergence acceleration of continued fraction $\K(a_n/b_n)$ is to use the modified approximants $S_n(\omega_n)$ in place of the classical approximants $S_n(0)$, where $\omega_n$ are close to tails $f^{(n)}$ of…
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…
We give continued fraction algorithms for a particular class of Fuchsian triangle groups. In particular, we give an explicit form of each such group that is a subgroup of the Hilbert modular group of its trace field and provide an interval…
In this work, we present continued fractions for the arithmetic, geometric, harmonic and cotangent means of $[a_0,a_1,\dots,a_k]$ and $[a_0,a_1,\dots,a_k,a_{k+1}]$, and some of their applications.
For more than a century and a half it has been widely-believed (but was never rigorously shown) that the physics of diffraction imposes certain fundamental limits on the resolution of an optical system. However our understanding of what…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…
Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
The direct calculation of the Generalized operator entropy proves difficult by the appearance of rational exponents of matrices. The main motivation of this work is to overcome these difficulties and to present a practical and efficient…
We discuss a proposal for a continued fraction-like algorithm to determine simultaneous rational approximations to $d$ real numbers $\alpha_1,\ldots,\alpha_d$. It combines an algorithm of Hermite and Lagarias with ideas from LLL-reduction.…
Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.