Related papers: Superoptimal continued fractions
A recent line of ground-breaking results for permutation-based SGD has corroborated a widely observed phenomenon: random permutations offer faster convergence than with-replacement sampling. However, is random optimal? We show that this…
We prove an explicit formula for infinitely many convergents of Hurwitzian continued fractions that repeat several copies of the same constant and elements of one arithmetic progression, in a quasi-periodic fashion. The proof involves…
In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…
A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for $D$-optimal criterion on continuous design spaces are…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in…
We introduced a new continued fraction expansions in our previous paper. For these expansions, we show formulae of probability about incomplete quotients. Furthermore, we prove the existence of invariant measures with respect to the…
This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the…
We provide several asymptotic expansions of the prime counting function $\pi(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly…
We introduce a new, large class of continued fraction algorithms producing what are called contracted Farey expansions. These algorithms are defined by coupling two acceleration techniques -- induced transformations and contraction -- in…
In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…
In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to…
Let $f(x) \in \mathbb{Z}[x]$. Set $f_{0}(x) = x$ and, for $n \geq 1$, define $f_{n}(x)$ $=$ $f(f_{n-1}(x))$. We describe several infinite families of polynomials for which the infinite product \prod_{n=0}^{\infty} (1 + \frac{1}{f_{n}(x)})…
We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computational resources, the answer to a problem that…
For any quantity of interest in a system governed by ordinary differential equations, it is natural to seek the largest (or smallest) long-time average among solution trajectories, as well as the extremal trajectories themselves. Upper…
We investigate some properties of the higher continued fractions defined recently by Musiker, Ovenhouse, Schiffler, and Zhang. We prove that the maps defining the higher continued fractions are increasing continuous functions on the…
In some recent papers, the authors considered regular continued fractions of the form \[ [a_{0};\underbrace{a,...,a}_{m}, \underbrace{a^{2},...,a^{2}}_{m}, \underbrace{a^{3},...,a^{3}}_{m}, ... ], \] where $a_{0} \geq 0$, $a \geq 2$ and $m…
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…
A contiguous relation for complementry pairs of very well poised balanced ${}_{10}\phi_9$ basic hypergeometric functions is used to derive an explict expression for the associated continued fraction. This generalizes the continued fraction…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…