English
Related papers

Related papers: Algorithmic concepts for the computation of Jacobs…

200 papers

One may consider the generalization of Jacobi polynomials and the Jacobi function of the second kind to a general function where the index is allowed to be a complex number instead of a non-negative integer. These functions are referred to…

Classical Analysis and ODEs · Mathematics 2023-08-29 Howard S. Cohl , Roberto S. Costas-Santos

We consider the regular parts for basic functions of prime numbers with Riemann approximation accuracy.

Number Theory · Mathematics 2007-05-23 R. M. Abrarov , S. M. Abrarov

For every sufficiently large integer $R$, there exists a Carmichael number with exactly $R$ prime factors.

Number Theory · Mathematics 2025-10-21 Daniel Larsen , Thomas Wright

This paper introduces some efficient initials for a well-known algorithm (an inverse iteration) for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algorithm but are also…

Probability · Mathematics 2016-11-23 Mu-Fa Chen

Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning'…

Probability · Mathematics 2021-07-21 Letizia Angeli , Stefan Grosskinsky , Adam M. Johansen

Fortran 77 programs for the computation of modified Bessel functions of purely imaginary order are presented. The codes compute the functions $K_{ia}(x)$, $L_{ia}(x)$ and their derivatives for real $a$ and positive $x$; these functions are…

Mathematical Software · Computer Science 2007-05-23 Amparo Gil , Javier Segura , Nico M. Temme

Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…

Mathematical Physics · Physics 2014-02-12 Gabriel Seiden

This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…

Number Theory · Mathematics 2015-06-01 Douglas B. Staple

We present two improvements to arithmetic in the Jacobian of global function fields based on the approach of Hess. The first reduces the number of expensive reduction steps by optimizing for typical inputs rather than worst-case behavior,…

Number Theory · Mathematics 2026-05-18 Vincent Macri , Michael Jacobson , Renate Scheidler

We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea…

Number Theory · Mathematics 2024-04-09 Yichen You

We examine indefinite integral involving of arbitrary power $x$, multiplied by three spherical Bessel functions of the first kind $j_{h},j_{k}$, and $j_{l}$ with integer order $h,k,l \geq 0$ and an exponential. Then we add some conditions…

General Mathematics · Mathematics 2022-11-17 Teboho Moloi

A new computational procedure is offered to provide simple, accurate and flexible methods for using modern computers to give numerical evaluations of the various Bessel functions. The Trapezoidal Rule, applied to suitable integral…

Numerical Analysis · Mathematics 2015-06-11 Charles Schwartz

Motivated by rigorous development in the theory of digamma functions, we have first derived some new identities for the digamma function, and then computed the values of digamma function for the fractional orders using these identities…

Classical Analysis and ODEs · Mathematics 2018-06-22 M. I. Qureshi , Mohd Shadab

There are two well-known ways of doing arithmetic with ordinal numbers: the "ordinary" addition, multiplication, and exponentiation, which are defined by transfinite iteration; and the "natural" (or Hessenberg) addition and multiplication…

Logic · Mathematics 2017-11-10 Harry Altman

In this paper we introduce the third order Jacobsthal quaternions and the third order Jacobsthal-Lucas quaternions and give some of their properties. We derive the relations between third order Jacobsthal numbers and third order Jacobsthal…

Combinatorics · Mathematics 2017-06-29 Gamaliel Cerda-Morales

We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.

General Mathematics · Mathematics 2023-06-21 Michael P. May

I give some claims on primorial prime numbers for interested readers in number theory.

General Mathematics · Mathematics 2007-05-23 Turker Ozsari

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

Differentiable real function reproducing primes up to a given number and having a differentiable inverse function is constructed. This inverse function is compared with the Riemann-Von Mangoldt exact expression for the number of primes not…

Number Theory · Mathematics 2007-05-23 Lumomir Alexandrov , D. B. Baranov , Plamen Yotov

The Jacobi-Stirling numbers and the Legendre-Stirling numbers of the first and second kind were first introduced in [6], [7]. In this paper we note that Jacobi-Stirling numbers and Legendre-Stirling numbers are specializations of elementary…

Combinatorics · Mathematics 2012-04-03 Pietro Mongelli