اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDistinct distances on hyperbolic surfaces
154
0
0.0
(
0
)
تأليف
Xianchang Meng
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For any cofinite Fuchsian group $Gammasubset {rm PSL}(2, mathbb{R})$, we show that any set of $N$ points on the hyperbolic surface $Gammabackslashmathbb{H}^2$ determines $geq C_{Gamma} frac{N}{log N}$ distinct distances for some constant $C_{Gamma}>0$ depending only on $Gamma$. In particular, for $Gamma$ being any finite index subgroup of ${rm PSL}(2, mathbb{Z})$ with $mu=[{rm PSL}(2, mathbb{Z}): Gamma ]<infty$, any set of $N$ points on $Gammabackslashmathbb{H}^2$ determines $geq Cfrac{N}{mulog N}$ distinct distances for some absolute constant $C>0$.
قيم البحث
اقرأ أيضاً
In this paper, we introduce the notion of geodesic cover for Fuchsian groups, which summons copies of fundamental polygons in the hyperbolic plane to cover pairs of representatives realizing distances in the corresponding hyperbolic surface. Then we
use estimates of geodesic-covering numbers to study the distinct distances problem in hyperbolic surfaces. Especially, for $Y$ from a large class of hyperbolic surfaces, we establish the nearly optimal bound $geq c(Y)N/log N$ for distinct distances determined by any $N$ points in $Y$, where $c(Y)>0$ is some constant depending only on $Y$. In particular, for $Y$ being modular surface or standard regular of genus $ggeq 2$, we evaluate $c(Y)$ explicitly. We also derive new sum-product type estimates.
In this paper we study the common distance between points and the behavior of a constant length step discrete random walk on finite area hyperbolic surfaces. We show that if the second smallest eigenvalue of the Laplacian is at least 1/4, then the di
stances on the surface are highly concentrated around the minimal possible value, and that the discrete random walk exhibits cutoff. This extends the results of Lubetzky and Peres ([20]) from the setting of Ramanujan graphs to the setting of hyperbolic surfaces. By utilizing density theorems of exceptional eigenvalues from [27], we are able to show that the results apply to congruence subgroups of $SL_{2}left(mathbb{Z}right)$ and other arithmetic lattices, without relying on the well known conjecture of Selberg ([28]). Conceptually, we show the close relation between the cutoff phenomenon and temperedness of representations of algebraic groups over local fields, partly answering a question of Diaconis ([7]), who asked under what general phenomena cutoff exists.
The emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the distance-numb
er of trees, graphs with no $K^-_4$-minor, complete bipartite graphs, complete graphs, and cartesian products. Our main results concern the distance-number of graphs with bounded degree. We prove that $n$-vertex graphs with bounded maximum degree and bounded treewidth have distance-number in $mathcal{O}(log n)$. To conclude such a logarithmic upper bound, both the degree and the treewidth need to be bounded. In particular, we construct graphs with treewidth 2 and polynomial distance-number. Similarly, we prove that there exist graphs with maximum degree 5 and arbitrarily large distance-number. Moreover, as $Delta$ increases the existential lower bound on the distance-number of $Delta$-regular graphs tends to $Omega(n^{0.864138})$.
We study ErdH oss distinct distances problem under $ell_p$ metrics with integer $p$. We improve the current best bound for this problem from $Omega(n^{4/5})$ to $Omega(n^{6/7-epsilon})$, for any $epsilon>0$. We also characterize the sets that span an
asymptotically minimal number of distinct distances under the $ell_1$ and $ell_infty$ metrics.
We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $ntoinfty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic partition function
of primes, in number theory called the generating function of the distinct prime partitions, in the saddle-point approximation. We find that our result of $Q_{as}(n)$, which includes two higher-order corrections to the leading term in its exponent and a pre-exponential correction factor, approximates the exact $Q(n)$ far better than its simple leading-order exponential form given so far in the literature.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
