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.

No abstract uploaded!

We study a local multiplicity problem related to so-called generalized Shalika models. By establishing a local trace formula for these kind of models, we are able to prove a multiplicity formula for discrete series. As a result, we can show that these multiplicities are constant over every discrete Vogan L-packet and are related to local exterior square L-functions.

No abstract uploaded!

The estimate of integral points in an n-dimensional polyhedron has many applications in singularity theory, number theory and toric geometry. The third named author formulated a conjecture (i.e., Yau Number Theoretic Conjecture) which gives a sharp polynomial upper estimate on the number of positive integral points in n-dimensional (n  3) real right-angled simplices. The previous results on the conjecture in low dimension cases (n  6) have been proved by using the sharp GLY conjecture. However, it is only valid in low dimension. The Yau Number Theoretic Conjecture for n = 7 has been shown with a completely new method in [22]. In this paper, on the one hand, the similar method has been applied to prove the conjecture for n = 8, but with more meticulous analyses. The main method of proof is summing existing sharp upper bounds for the number of points in seven-dimensional simplex over the cross sections of eight-dimensional simplex. This is a signicant progress since it sheds light on proving the Yau Number Theoretic Conjecture in full generality. On the other hand, we give a new sharper estimate of the Dickman-De Bruijn function (x; y) for 5  y < 23, compared with the result obtained by Ennola.