Related papers: Commensurable continued fractions
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
Special kinds of continued fractions have been proved to converge to transcendental real numbers by means of the celebrated Subspace Theorem. In this paper we study the analogous $p$--adic problem. More specifically, we deal with Browkin…
The Fast Reciprocal Square Root Algorithm is a well-established approximation technique consisting of two stages: first, a coarse approximation is obtained by manipulating the bit pattern of the floating point argument using integer…
The growing interest for high dimensional and functional data analysis led in the last decade to an important research developing a consequent amount of techniques. Parallelized algorithms, which consist in distributing and treat the data…
We use a continued fraction approach to compare two statistical ensembles of quadrangulations with a boundary, both controlled by two parameters. In the first ensemble, the quadrangulations are bicolored and the parameters control their…
Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…
We present complexity and numerical results for a new asynchronous parallel algorithmic method for the minimization of the sum of a smooth nonconvex function and a convex nonsmooth regularizer, subject to both convex and nonconvex…
We give several unequivalent notions of convergency of meromorphic functions and more generally meromorphic mappings (strong, weak, $\Gamma $-convergency and some others). Relations between them are investigated. A version of Rouche theorem…
We prove, for quasicompact separated schemes over ground fields, that Cech cohomology coincides with sheaf cohomology with respect to the Nisnevich topology. This is a partial generalization of Artin's result that for noetherian schemes…
We show how our recent results on compositions of d.c. functions (and mappings) imply positive results on extensions of d.c. functions (and mappings). Examples answering two natural relevant questions are presented. Two further theorems,…
Let $\mathcal{A}$ and $\mathcal{B}$ be two algebras and let $n$ be a positive integer. A linear mapping $D:\mathcal{A} \rightarrow \mathcal{B}$ is called a \emph{strongly generalized derivation of order $n$} if there exist families of…
We show that the statistics of the continued fraction expansion of a randomly chosen rational in the unit interval, with a fixed large denominator $q$, approaches the Gauss-Kuzmin statistics with polynomial rate in $q$. This improves on…
We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmod{\alpha}$ has the solution $\beta$ with $0 < \beta < \alpha$ if and only if $\alpha/\beta$ has a continued fraction expansion with sequence of…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Douglas-Rachford or Averaged Alternating Reflection Algorithm…
We give a new $(1+\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\sqrt{\log n\log r}$ bigger, for some small $r$; this…
A two-dimensional Gauss-Kuzmin theorem for $N$-continued fraction expansions is shown. More exactly, we obtain a Gauss-Kuzmin theorem related to the natural extension of the measure-dynamical system corresponding to these expansions. Then,…
We present natural axisymmetric variants of schemes for curvature flows introduced earlier by the present authors and analyze them in detail. Although numerical methods for geometric flows have been used frequently in axisymmetric settings,…
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…
Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and science. The computations rely on the floating-point arithmetic specified by the IEEE754 Standard. In this context, an elementary brick of…