Lattice points for products of upper half planes

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Let $\Gamma$ be an irreducible lattice in $\PSL_2(\RR)^d$ ($d\in\NN$) and $z$ a point in the $d$-fold direct product of the upper half plane. We study the discrete set of componentwise distances ${\bf D}(\Gm,z)\subset \RR^d$ defined in (1). We prove asymptotic results on the number of $\gm\in\Gm$ such that $d(z,\gamma z$ is contained in strips expanding in some directions and also in expanding hypercubes. The results on the counting in expanding strips are new. The results on expanding hypercubes % improve the error terms improve the existing error terms (by Gorodnick and Nevo) and generalize the Selberg error term for $d=1$. We give an asymptotic formula for the number of lattice points $\gamma z$ such that the hyperbolic distance in each of the factors satisfies $d((\gamma z)_j, z_j)\le T$. The error term, as $T \to \infty$ generalizes the error term given by Selberg for $d=1$, also we describe how the counting function depends on $z$. We also prove asymptotic results when the distance satisfies $A_j \le d((\gamma z)_j, z_j) < B_j$, with fixed $A_j < B_j$ in some factors, while in the remaining factors $0 \le d((\gamma z)_j, z_j) \le T$ is satisfied.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Lattice points for products of upper half planes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lattice points for products of upper half planes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lattice points for products of upper half planes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-174120

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.