Related papers: A Refinement of Ramanujan's Factorial Approximatio…
In this paper, we enhance a recent algorithm for approximate spectral factorization of matrix functions, extending its capabilities to precisely factorize rational matrices when an exact lower-upper triangular factorization is available.…
Ramanujan sums are exponential sums with exponent defined over the irreducible fractions. Until now, they have been used to provide converging expansions to some arithmetical functions appearing in the context of number theory. In this…
We use the generating function approach to derive simple expressions for the factorial moments of the distance distribution over Reed-Solomon codes. We obtain better upper bounds for the error term of a counting formula given by Li and Wan,…
We make explicit a theorem of Pintz concerning the error term in the prime number theorem. This gives an improved version of the prime number theorem with error term roughly square-root of that which was previously known. We apply this to a…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
Lavrik and the author gave uniform bounds of the error term in the approximate functional equation for the derivatives of the Hardy's Z-function. We obtain a new bound of this error term which is much better for high order derivatives.
A simple proof of Ramanujan's formula for the Fourier transform of the square of the modulus of the Gamma function restricted to a vertical line in the right half-plane is given. The result is extended to vertical lines in the left…
As an extension of the classical irreducibility result of Dumas, a factorization result for polynomials over any valued field with a Krull valuation of arbitrary rank is proved. Further, a lower degree factor bound on factors of a given…
We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms…
This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…
Let $Q(n)$ denote the number of integers $1 \leq q \leq n$ whose prime factorization $q= \prod^{t}_{i=1}p^{a_i}_i$ satisfies $a_1\geq a_2\geq \ldots \geq a_t$. Hardy and Ramanujan proved that $$ \log Q(n) \sim \frac{2\pi}{\sqrt{3}}…
We continue studying the problem of analytic approximation of matrix functions. We introduce the notion of a partial canonical factorization of a badly approximable matrix function $\Phi$ and the notion of a canonical factorization of a…
In this article we derive an approximation inequality for continued radicals, generalizing an inequality of Herschfeld for continued square roots to arbitrary radicals, which is useful in exploring convergence issues and obtaining…
In this article we present evaluations of continued fractions studied by Ramanujan. More precisely we give the complete polynomial equations of Rogers-Ramanujan and other continued fractions, using tools from the elementary theory of the…
In the first part we establish a connection between the Euler-Maclaurin summation formula and the Rota-Baxter functional equation. In the second part we give a simple proof of a formula, due to Ramanujan, on the summation of certain…
If a continued fraction $K_{n=1}^{\infty} a_{n}/b_{n}$ is known to converge but its limit is not easy to determine, it may be easier to use an extension of $K_{n=1}^{\infty}a_{n}/b_{n}$ to find the limit. By an extension of…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
A new recursive procedure for calculation of restricted partition function is suggested. An explicit formula for the restricted partition function is found based on this procedure.
We use the rationality of the generalized $h^{th}$ convergent functions, $Conv_h(\alpha, R; z)$, to the infinite J-fraction expansions enumerating the generalized factorial product sequences, $p_n(\alpha, R) =…
In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to generate all necessary analytic terms for the Boltzmann…