Related papers: Il Fattore di Sylvester

Let $\zeta(s)$ and $Z(t)$ be the Riemann zeta function and Hardy's function respectively. We show asymptotic formulas for $\int_0^T Z(t)\zeta(1/2+it)dt$ and $\int_0^T Z^2(t) \zeta(1/2+it)dt$. Furthermore we derive an upper bound for…

We present a general formula for the Atiyah-Sutcliffe determinant function, which holds for any integer $n \geq 2$, as a global factor times a sum of terms, with each term similar to a higher degree cross-ratio. The formula is to our…

Symplectic $Q$-functions are a symplectic analogue of Schur $Q$-functions and defined as the $t=-1$ specialization of Hall--Littlewood functions associated with the root system of type $C$. In this paper we prove that symplectic…

Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…

The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…

Lindel\"of conjectured that the Riemann zeta function $\zeta(\sigma+it)$ grows more slowly than any fixed positive power of $t$ as $t\rightarrow\infty$ when $\sigma\geq 1/2$. Hardy and Littlewood showed that this is equivalent to the…

Finite Euler product is known to be one of the classical zeta functions in number theory. In [1], [2] and [3], we have introduced some multivariable zeta functions and studied their definable probability distributions on R^d. They include…

We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…

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)…

We define an S function as the sum of the asymptotic error terms of digamma function of an arithmetic series, $S(a) \equiv \sum_{n=1}^\infty \left[\ln\frac{n}{a} - \frac{a}{2n}-\psi\left(\frac{n}{a}\right)\right]$, and show a few properties…

Littlewood's theorem is one of the pioneering results in random analytic functions over the open unit disk. In this paper, we prove some analogues of this theorem for Hardy spaces in infinitely many variables. Our results not only cover…

Let $L_1$, $L_2$ $L_3$ be integer linear functions with no fixed prime divisor. We show there are infinitely many $n$ for which the product $L_1(n)L_2(n)L_3(n)$ has at most 7 prime factors, improving a result of Porter. We do this by means…

We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…

In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…

A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…

The ternary Goldbach conjecture states that every odd number $n\geq 7$ is the sum of three primes. The estimation of the Fourier series $\sum_{p\leq x} e(\alpha p)$ and related sums has been central to the study of the problem since Hardy…

The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…

The product of any finite number of factorial Schur functions can be expanded as a $Z[y]$-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the…

Recently, Schlosser and Zhou proposed many conjectures on sign patterns of the coefficients appearing in the $q$-series expansions of the infinite Borwein product and other infinite products raised to a real power. In this paper, we will…