We enhance the efficient congruencing method for estimating Vinogradov’s integral for moments of order 2$s$, with $${1\leqslant s\leqslant k^{2}-1}$$ . In this way, we prove the main conjecture for such even moments when $${1\leqslant s\leqslant \tfrac{1}{4}(k+1)^{2}}$$ , showing that the moments exhibit strongly diagonal behaviour in this range. There are improvements also for larger values of$s$, these finding application to the asymptotic formula in Waring’s problem.

No abstract uploaded!

Multizeta values in positive characteristic were first introduced and studied by Thakur. He and Lara Rodr\'{\i}guez \cite{LRT} discovered and conjectured certain zeta-like families. Kuan, Lin and Yu stated more conjectures about zeta-like multizeta values in \cite{LK}. In the present paper we study and give the transparent formula for certain Anderson-Thakur polynomials. This enables us to confirm the conjectured zeta-like families.

We calculate a G_2-period of a Fourier coefficient of a cuspidal Eisenstein series on the split simply-connected group E_6, and relate this period to the Ginzburg-Rallis period of cusp forms on GL_6. This gives us a relation between the Ginzburg-Rallis period and the central value of the exterior cube L-function of GL_6.

The subject of counting positive lattice points in n-dimensional simplexes has interested mathematicians for decades due to its applications in singularity the- ory and number theory. Enumerating the lattice points in a right-angled simplex is equivalent to determining the geometric genus of an isolated singularity of a weighted homogeneous complex polynomial. It is also a method to shed insight into large gaps in the sequence of prime numbers. Seeking to contribute to these applications, in this paper, we prove the Yau Geometric Conjecture in six dimensions, a sharp upper bound for the number of positive lattice points in a six-dimensional tetrahedron. The main method of proof is summing existing sharp upper bounds for the number of points in 5-dimensional simplexes over the cross sections of the six-dimensional simplex. Our new results pave the way for the proof of a fully general sharp upper bound for the number of lattice points in a simplex. It also sheds new light on proving the Yau Geometric and Yau Number-Theoretic Conjectures in full generality.