Related papers: On the arithmetic of multidimensional continued fr…
We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…
To compare continued fraction digits with the denominators of the corresponding approximants we introduce the arithmetic-geometric scaling. We will completely determine its multifractal spectrum by means of a number theoretical free energy…
We consider a variation of the classical proximal-gradient algorithm for the iterative minimization of a cost function consisting of a sum of two terms, one smooth and the other prox-simple, and whose relative weight is determined by a…
In this paper we introduce a generalization of palindromic continued fractions as studied by Adamczewski and Bugeaud. We refer to these generalized palindromes as $m$-palindromes, where $m$ ranges over the positive integers. We provide a…
We present a computationally efficient algorithm for stable numerical differentiation from noisy, uniformly-sampled data on a bounded interval. The method combines multi-interval Fourier extension approximations with an adaptive domain…
The presence of large partial quotients can invalidate many classical limit theorems in the metric theory of continued fractions. A commonly employed strategy to overcome this problem is to discard the largest partial quotient when…
We consider a class of nonsmooth fractional programming problems with fixed-point constraints, where the numerator is convex and the denominator is concave. To solve this problem, we propose splitting algorithms that compute subgradient…
Nonlinear two-point boundary value problems arise in numerous areas of application. The existence and number of solutions for various cases has been studied from a theoretical standpoint. These results generally rely upon growth conditions…
The divided cell algorithm was introduced by Delone in 1947 to calculate the inhomogeneous minima of binary quadratic forms and developed further by E. S. Barnes and H. P. F. Swinnerton-Dyer in the 1950s. We show how advances of the past…
We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation…
Many classical identities arise from nothing more mysterious than looking at the same object in two different ways. A number, a function, or a combinatorial object may admit several natural decompositions, and by disassembling it in one way…
This is one of our series papers on multistep schemes for solving forward backward stochastic differential equations (FBSDEs) and related problems. Here we extend (with non-trivial updates) our multistep schemes in [W. Zhao, Y. Fu and T.…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
A {\it two-dimensional continued fraction expansion} is a map $\mu$ assigning to every $x \in\mathbb R^2\setminus\mathbb Q^2$ a sequence $\mu(x)=T_0,T_1,\dots$ of triangles $T_n$ with vertices $x_{ni}=(p_{ni}/d_{ni},q_{ni}/d_{ni})\in\mathbb…
In 1928, Jarn\'{\i}k \cite{Jar} obtained that the set of continued fractions with bounded coefficients has Hausdorff dimension one. Good \cite{Goo} observed a dimension drop phenomenon by proving that the Hausdorff dimension of the set of…
We use the Schmidt Subspace Theorem to establish the transcendence of a class of quasi-periodic continued fractions. This improves earlier works of Maillet and of A. Baker. We also improve an old result of Davenport and Roth on the rate of…
This paper presents a high-accuracy higher-order multiscale method for solving multi-continuum problems in in highly heterogeneous media. First, microscopic unit cell functions are defined, leading to the derivation of macroscopic…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
Given two polynomials, we find a convergence property of the GCD of the rising factorial and the falling factorial. Based on this property, we present a unified approach to computing the universal denominators as given by Gosper's algorithm…
The continued logarithm algorithm was introduced by Gosper around 1978, and recently studied by Borwein, Calkin, Lindstrom, and Mattingly. In this note I show that the continued logarithm algorithm terminates in at most 2 log_2 p + O(1)…