Documentation

Compute µ(σ) such that |ζ(σ+it)| ≪ |t|^µ(σ) . See equation (7.57) in Ivić2003.

An attempt to reverse zetaOnS.

Compute maximal m(σ) such that ∫_1^T |ζ(σ+it)|^m(σ) dt ≪ T^(1+ε). See equation (8.97) in Ivić2003. Further justification will be published elsewhere.

Try to reverse mOnS: for a given precision and m compute minimal possible σ. Implementation is usual try-and-divide search, so performance is very poor. Sometimes, when mOnS gets especially lucky exponent pair, reverseMOnS can miss real σ and returns significantly bigger value.

For integer m>=4 this function corresponds to the multidimensional Dirichlet problem and returns σ from error term O(x^{σ+ε}). See Ch. 13 in Ivić2003.

Check whether ∫_1^T Π_i |ζ(n_i*σ+it)|^m_i dt ≪ T^(1+ε) for a given list of pairs [(n_1, m_1), ...] and fixed σ.

Find for a given precision and list of pairs [(n_1, m_1), ...] the minimal σ such that ∫_1^T Π_i|ζ(n_i*σ+it)|^m_i dt ≪ T^(1+ε).

Compute minimal M(A) such that ∫_1^T |ζ(1/2+it)|^A dt ≪ T^(M(A)+ε). See Ch. 8 in Ivić2003. Further justification will be published elsewhere.

Try to reverse mBigOnHalf: for a given M(A) find maximal possible A. Sometimes, when mBigOnHalf gets especially lucky exponent pair, reverseMBigOnHalf can miss real A and returns lower value.

An estimate of the symmetric multidimensional divisor function from Kolpakova, 2011.