Let $E_{\sigma }\left(T\right)$ be the error term in the mean square formula of the Riemann zeta-function in the critical strip $1/2\<\sigma \<1$. It is an analogue of the classical error term $E\left(T\right)$. The research of $E\left(T\right)$ has a long history but the investigation of $E_{\sigma }\left(T\right)$ is quite new. In particular there is only a few information known about $E_{\sigma }\left(T\right)$ for $3/4\<\sigma \<1$. As an exploration, we study its mean value ${\int }_1^T{E}_{\sigma }\left(u\right)du$. In this paper, we give it an Atkinson-type series expansion and explore many of its properties as a function of $T$.

In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving problems for polynomials in one variable in an optimal way. So, using this method we can compute the greatest common divisor of two polynomials in one variable with integer coefficients avoiding the exponential growth of the coefficients that will appear if we use the Euclidean Algorithm.In this note, generalizing a forgotten construction appearing in [Hab], we extend the Subresultant Theory to the...

We give a survey of computational class field theory. We first explain how to compute ray class groups and discriminants of the corresponding ray class fields. We then explain the three main methods in use for computing an equation for the class fields themselves: Kummer theory, Stark units and complex multiplication. Using these techniques we can construct many new number fields, including fields of very small root discriminant.

In this survey article we start from the famous Furstenberg theorem on non-lacunary semigroups of integers, and next we present its generalizations and some related results.

For a prime $p$ and positive integers $\ell \<k\<h\<p$ with $d=(h,k,\ell ,p-1)$, we show that $M$, the number of simultaneous solutions $x,y,z,w$ in ${\mathbb{Z}}_p^{*}$ to $x^h+y^h=z^h+w^h$, $x^k+y^k=z^k+w^k$, $x^{\ell }+y^{\ell }=z^{\ell }+w^{\ell }$, satisfies$${\displaystyle M\le 3d^2{(p-1)}^2+25hk\ell (p-1).}$$When $hk\ell =o\left(p{d}^2\right)$ we obtain a precise asymptotic count on $M$. This leads to the new twisted exponential sum bound$${\displaystyle \left|\sum _{x=1}^{p-1}\chi \left(x\right)e^{2\pi if\left(x\right)/p}\right|\le 3^{\frac{1}{4}}{d}^{\frac{1}{2}}{p}^{\frac{7}{8}}+\sqrt{5}{\left(hk\ell \right)}^{\frac{1}{4}}{p}^{\frac{5}{8}},}$$for trinomials $f=a{x}^h+b{x}^k+c{x}^{\ell }$, and to results on the average size of such sums.