اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLocal average in hyperbolic lattice point counting
166
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The hyperbolic lattice point problem asks to estimate the size of the orbit $Gamma z$ inside a hyperbolic disk of radius $cosh^{-1}(X/2)$ for $Gamma$ a discrete subgroup of $hbox{PSL}_2(R)$. Selberg proved the estimate $O(X^{2/3})$ for the error term for cofinite or cocompact groups. This has not been improved for any group and any center. In this paper local averaging over the center is investigated for $hbox{PSL}_2(Z)$. The result is that the error term can be improved to $O(X^{7/12+epsilon})$. The proof uses surprisingly strong input e.g. results on the quantum ergodicity of Maa{ss} cusp forms and estimates on spectral exponential sums. We also prove omega results for this averaging, consistent with the conjectural best error bound $O(X^{1/2+epsilon})$. In the appendix the relevant exponential sum over the spectral parameters is investigated.
قيم البحث
اقرأ أيضاً
We study the variance of the random variable that counts the number of lattice points in some shells generated by a special class of finite type domains in $mathbb R^d$. The proof relies on estimates of the Fourier transform of indicator functions of convex domains.
In this paper we prove the existence of asymptotic moments, and an estimate on the tails of the limiting distribution, for a specific class of almost periodic functions. Then we introduce the hyperbolic circle problem, proving an estimate on the asym
ptotic variance of the remainder that improves a result of Chamizo. Applying the results of the first part we prove the existence of limiting distribution and asymptotic moments for three functions that are integrat
We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a superelliptic c
urves $y^m=f(x)$ with $mge 2$ and $fin mathbb Z[x]$ any squarefree polynomial of degree $dge 3$, along with a positive integer $N$. It can compute $#X(mathbb F_p)$ for all $ple N$ not dividing $mmathrm{lc}(f)mathrm{disc}(f)$ in time $O(md^3 Nlog^3 Nloglog N)$. It achieves this by computing the trace of the Cartier--Manin matrix of reductions of $X$. We can also compute the Cartier--Manin matrix itself, which determines the $p$-rank of the Jacobian of $X$ and the numerator of its zeta function modulo~$p$.
In this short note, we reformulate the task of calculating the pair correlation statistics of a Kronecker sequence as a lattice point counting problem. This can be done analogously to the lattice based approach which was used to (re-)prove the famous
three gap property for Kronecker sequences. We show that recently developed lattice point counting techniques can then be applied to derive that a certain class of Kronecker sequences have $beta$-pair correlations for all $0 < beta < 1$.
Let $Sigma$ be a hyperbolic surface. We study the set of curves on $Sigma$ of a given type, i.e. in the mapping class group orbit of some fixed but otherwise arbitrary $gamma_0$. For example, in the particular case that $Sigma$ is a once-punctured to
rus, we prove that the cardinality of the set of curves of type $gamma_0$ and of at most length $L$ is asymptotic to $L^2$ times a constant.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
