اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBounds for a spectral exponential sum
59
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We prove new upper bounds for a spectral exponential sum by refining the process by which one evaluates mean values of $L$-functions multiplied by an oscillating function. In particular, we introduce a method which is capable of taking into consideration the oscillatory behaviour of the function. This gives an improvement of the result of Luo and Sarnak when $Tgeq X^{1/6+2theta/3}$. Furthermore, this proves the conjecture of Petridis and Risager in some ranges. Finally, this allows obtaining a new proof of the Soundararajan-Young error estimate in the prime geodesic theorem.
قيم البحث
اقرأ أيضاً
In this paper, we prove some extensions of recent results given by Shkredov and Shparlinski on multiple character sums for some general families of polynomials over prime fields. The energies of polynomials in two and three variables are our main ingredients.
We introduce a shifted convolution sum that is parametrized by the squarefree natural number $t$. The asymptotic growth of this series depends explicitly on whether or not $t$ is a emph{congruent number}, an integer that is the area of a rational rig
ht triangle. This series presents a new avenue of inquiry for The Congruent Number Problem.
We present new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to two related exponential codeword length objectives. The objectives explored here are exponential-average length and e
xponential-average redundancy. The first of these relates to various problems involving queueing, uncertainty, and lossless communications, and it can be reduced to the second, which has properties more amenable to analysis. These bounds, some of which are tight, are in terms of a form of entropy and/or the probability of an input symbol, improving on recently discovered bounds of similar form. We also observe properties of optimal codes over the exponential-average redundancy utility.
We establish exponential bounds for the hypergeometric distribution which include a finite sampling correction factor, but are otherwise analogous to bounds for the binomial distribution due to Leon and Perron (2003) and Talagrand (1994). We also est
ablish a convex ordering for sampling without replacement from populations of real numbers between zero and one: a population of all zeros or ones (and hence yielding a hypergeometric distribution in the upper bound) gives the extreme case.
Let $Gamma=PSL(2,Z[i])$ be the Picard group and $H^3$ be the three-dimensional hyperbolic space. We study the Prime Geodesic Theorem for the quotient $Gamma setminus H^3$, called the Picard manifold, obtaining an error term of size $O(X^{3/2+theta/2+
epsilon})$, where $theta$ denotes a subconvexity exponent for quadratic Dirichlet $L$-functions defined over Gaussian integers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
