Related papers: Telescoping continued fractions for the error term…
The construction of confidence intervals for the mean of a bounded random variable is a classical problem in statistics with numerous applications in machine learning and virtually all scientific fields. In particular, obtaining the…
We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional central slices, thus improving the previous best known…
We determine the classical approximation constants $w_{3}(\zeta),w_{3}^{\ast}(\zeta),\lambda_{3}(\zeta)$ such as the uniform constants $\widehat{w}_{3}(\zeta),\widehat{w}_{3}^{\ast}(\zeta),\widehat{\lambda}_{3}(\zeta)$ associated to real…
In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which…
We study strategies for increasing the precision in the blurring models by maintaining a complexity in the related numerical linear algebra procedures (matrix-vector product, linear system solution, computation of eigenvalues etc.) of the…
Statistical physics is employed to evaluate the performance of error-correcting codes in the case of finite message length for an ensemble of Gallager's error correcting codes. We follow Gallager's approach of upper-bounding the average…
We establish rigorous \emph{a posteriori} error bounds for a space-time finite element method of arbitrary order discretising linear wave problems in second order formulation. The method combines standard finite elements in space and…
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…
By using a jump transformation associated to the Romik map, we define a new continued fraction algorithm called odd-odd continued fraction, whose principal convergents are rational numbers of odd denominators and odd numerators. Among…
We propose a locally conservative enriched Galerkin scheme that preserves the physical bounds for an elliptic problem. To this end, we use a substantial over-penalization of the discrete solution's jumps to obtain optimal convergence. To…
The posterior Cram\'er-Rao lower bound (PCRLB) derived in Tichavsk\'y et al., 1998, provides a bound on the mean square error (MSE) obtained with any non-linear state filter. Computing the PCRLB involves solving complex, multi-dimensional…
We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…
In (Dzanic, J. Comp. Phys., 508:113010, 2024), a limiting approach for high-order discontinuous Galerkin schemes was introduced which allowed for imposing constraints on the solution continuously (i.e., everywhere within the element). While…
This chapter reviews and compares discontinuous Galerkin time-stepping methods for the numerical approximation of second-order ordinary differential equations, particularly those stemming from space finite element discretization of wave…
This paper continues the author's previous studies on continued fractions and Heron's algorithm, as from his former JMM2017 presentation (see \cite{CF.HA}).\par\medskip Extending the notion of continued fraction to the $p$-adic fields, one…
We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than…
In 1730 James Stirling, building on the work of Abraham de Moivre, published what is known as Stirling's approximation of $n!$. He gave a good formula which is asymptotic to $n!$. Since then hundreds of papers have given alternative proofs…
Hurwitz (1887) defined a continued fraction algorithm for complex numbers which is better behaved in many respects than a more "natural" extension of the classical continued fraction algorithm to the complex plane would be. Although the…
We establish a new transcendence criterion of $p$-adic continued fractions which are called Ruban continued fractions. By this result, we give explicit transcendental Ruban continued fractions with bounded $p$-adic absolute value of partial…
The generalized Lanczos trust-region (GLTR) method is one of the most popular approaches for solving large-scale trust-region subproblem (TRS). Recently, Jia and Wang [Z. Jia and F. Wang, \emph{SIAM J. Optim., 31 (2021), pp. 887--914}]…