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].

In this paper, we reprove a global converse theorem of Cogdell and Piatetski-Shapiro using purely global methods.

No abstract uploaded!

We derive an asymptotic formula which counts the number of abelian extensions of prime degrees over rational function fields. Specifically, let l be a rational prime and K a rational function field F_q(t) with l\nmid q. Let Discf (F/K) denote the finite discriminant of F over K. Denote the number of abelian l-extensions F/K with deg (Discf (F/K)) = (l − 1)αn by a_l(n), where α = α(q, l) is the order of q in the multiplicative group (Z/lZ)^\times. We give a explicit asymptotic formula for a_l(n). In the case of cubic extensions with q ≡ 2 (mod 3), our formula gives an exact analogue of Cohn’s classical formula.

No abstract uploaded!