No abstract uploaded!

This project was sponsored through the Schiff Fellowship program of Brandeis University. This project involved using the power series method to construct a third order nonlinear ordinary differential equation, a Schwarzian equation, for each of the "genus zero" modular functions, described in the Conway-Norton paper. We first use the Borcherd recursion formuli to generate, in each case, a modular function up to whatever degree we desire, and then use the fact that there is a Schwarzian equation, determined by a single rational function we call a Q-value. By similar power series methods, we compute the coefficients of our rational function, and hence have all the necessary data to create a Schwarzian differential equation for each modular function. This equation can, in turn, be used to recover the modular function itself.

We call a finite set ${\mathcal{D}}\subset {\Bbb Z}^s$ a {\it (self-affine) tile digit set} with respect to an expanding integral matrix ${\bf A}$ if the self-affine set $T({\bf A}, \D)$ is a tile in ${\Bbb R}^s$. It has been a widely open problem to characterize the tile digit sets for a given ${\bf A}$. While there are substantial investigations on ${\Bbb R}$, there is no result on ${\Bbb R}^s$ other than the case where $|\det {\bf A}| =p$ with $p$ a prime. In this paper, we make an initiation to study a basic case ${\bf A} = p{\bf I}_2$ in ${\Bbb R}^2$. We characterize the tile digit sets by making use of the zeros of the mask polynomial of ${\mathcal{D}}$ associated with a tile criterion of Kenyon [K], together with a recent result of Iosevich {\it et al} on factorization of sets in ${\Bbb Z}_p \times {\Bbb Z}_p$ [IMP].

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!