Related papers: Algorithmic concepts for the computation of Jacobs…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…
We describe several improvements to algorithms for the rigorous computation of the endomorphism ring of the Jacobian of a curve defined over a number field.
This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less one million. The conjecture has also been tested for ternary representation…
Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…
The aim of this note is to estimate the tail of the distribution of the number of particles in an interval under determinantal and Pfaffian point processes. The main result of the note is that the square of the number of particles under the…
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…
Given the first 20-100 coefficients of a typical generating function of the type that arises in many problems of statistical mechanics or enumerative combinatorics, we show that the method of differential approximants performs surprisingly…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…
The moments of Bessel functions and Bessel-trigonometric functions play a basic role in many practical problems and numerical analysis. This paper presents a complete analysis for these moments based on the recursive relations of Bessel…
We propose a new modified primal-dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
The computation of the Mittag-Leffler (ML) function with matrix arguments, and some applications in fractional calculus, are discussed. In general the evaluation of a scalar function in matrix arguments may require the computation of…
In this paper we study the classical problem of throughput maximization. In this problem we have a collection $J$ of $n$ jobs, each having a release time $r_j$, deadline $d_j$, and processing time $p_j$. They have to be scheduled…
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
We investigate the differential equation for the Jacobi-type polynomials which are orthogonal on the interval $[-1,1]$ with respect to the classical Jacobi measure and an additional point mass at one endpoint. This scale of higher-order…
In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…
We describe a rigorous implementation of the Lagarias and Odlyzko Analytic Method to evaluate the prime counting function and its use to compute unconditionally the number of primes less than $10^{24}$.
In this study, we introduce the generalized Gaussian third-order Jacobsthal numbers with arbitrary initial values and discuss two particular cases, namely, Gaussian third-order Jacobsthal and Gaussian modified third-order Jacobsthal…
This is the second of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…
We formulate, using heuristic reasoning, precise conjectures for the range of the number of primes in intervals of length $y$ around $x$, where $y\ll (\log x)^2$. In particular we conjecture that the maximum grows surprisingly slowly as $y$…