Related papers: Dickman multiple polylogarithms and the Lindemann-…

This paper is intended as a sequel to a paper arXiv:0803.2636 written by four of the coauthors here. In the paper, they proved a stronger form of the Erd\H{o}s-Mirksy conjecture which states that there are infinitely many positive integers…

Let m>=1 be an arbitrary fixed integer and let N_m(x) count the number of odd integers u<=x such that the order of 2 modulo u is not divisible by m. In case m is prime estimates for N_m(x) were given by H. Mueller that were subsequently…

Letting $L_{n}(N, u)$ denote a polylogarithm ladder of weight $n$ and index $N$ with $u$ as an algebraic number, there is a rich history surrounding how mathematical objects of this form can be constructed for a given weight or index. This…

Let $N$ denote a sufficiently large even integer and $x$ denote a sufficiently large integer, we define $D_{1,2}(N)$ as the number of primes $p$ that such that $N - p$ has at most 2 prime factors. In this paper, we show that $D_{1,2}(N)…

Let phi denote Euler's phi function. For a fixed odd prime we give an asymptotic series expansion in the sense of Poincare for the number E_q(x) of n<=x such that q does not divide phi(n). Thereby we improve on a recent theorem of B.K.…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

Let $d_k(n)$ denote the $k$-fold divisor function. For a wide range of large $q$ the expected bound $$\sum_{n\leq x\atop {n\equiv a(q)}}d_k(n)-\text { main term }\approx \sqrt {x/q}$$ is shown to be true in an average sense -- for all $k$.…

We show that the distribution function of the first particle in a discrete orthogonal polynomial ensemble can be obtained through a certain recurrence procedure, if the (difference or q-) log-derivative of the weight function is rational.…

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…

A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the…

In [1], we give Dickson's conjecture on $N^n$. In this paper, we further give Dickson's conjecture on $Z^n$ and obtain an equivalent form of Green-Tao's conjecture [2]. Based on our work, it is possible to establish a general theory that…

In 1999, Iwan Duursma defined the zeta function for a linear code as a generating function of its Hamming weight enumerator. It can also be defined for other homogeneous polynomials not corresponding to existing codes. If the homogeneous…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Hittmeir recently presented a deterministic algorithm that provably computes the prime factorisation of a positive integer $N$ in $N^{2/9+o(1)}$ bit operations. Prior to this breakthrough, the best known complexity bound for this problem…

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…

How many quantum queries are required to determine the coefficients of a degree-$d$ polynomial in $n$ variables? We present and analyze quantum algorithms for this multivariate polynomial interpolation problem over the fields…

The theory of orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to functional-difference…

The scheme of divided differences is widely used in many approximation and interpolation problems. Computing the Newton coefficients of the interpolating polynomial is the first step of the Bj\"{o}rck and Pereyra algorithm for solving…

We study almost prime solutions of systems of Diophantine equations in the Birch setting. Previous work shows that there exist integer solutions of size B with each component having no prime divisors below $B^{1/u}$, where $u=c_0n^{3/2}$,…

The aim of this paper is to try to establish a generic model for the problem that several multivariable number-theoretic functions represent simultaneously primes for infinitely many integral points. More concretely, we introduced briefly…