اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConstruction of nearly hyperbolic distance on punctured spheres
61
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We define a distance function on the bordered punctured disk $0<|z|le 1/e$ in the complex plane, which is comparable with the hyperbolic distance of the punctured unit disk $0<|z|<1.$ As an application, we will construct a distance function on an $n$-times punctured sphere which is comparable with the hyperbolic distance. We also propose a comparable quantity which is not necessarily a distance function on the punctured sphere but easier to compute.
قيم البحث
اقرأ أيضاً
In some other context, the question was raised how many nearly Kahler structures exist on the sphere $S^6$ equipped with the standard Riemannian metric. In this short note, we prove that, up to isometry, there exists only one. This is a consequence
of the description of the eigenspace to the eigenvalue $lambda = 12$ of the Laplacian acting on 2-forms. A similar result concerning nearly parallel $G_2$-structures on the round sphere $S^7$ holds, too. An alternative proof by Riemannian Killing spinors is also indicated.
We study compactifications of $6d$ non minimal $(D_{p+3},D_{p+3})$ type conformal matter. These can be described by $N$ M5-branes probing a $D_{p+3}$-type singularity. We derive $4d$ Lagrangians corresponding to compactifications of such $6d$ SCFTs o
n three punctured spheres (trinions) with two maximal punctures and one minimal puncture. The trinion models are described by simple $mathcal{N}=1$ quivers with $SU(2N)$ gauge nodes. We derive the trinion Lagrangians using RG flows between the aforementioned $6d$ SCFTs with different values of $p$ and their relations to matching RG flows in their compactifications to $4d$. The suggested trinions are shown to reduce to known models in the minimal case of $N=1$. Additional checks are made to show the new minimal punctures uphold the expected S-duality between models in which we exchange two such punctures. We also show that closing the new minimal puncture leads to expected flux tube models.
We introduce a class of normal complex spaces having only mild sin-gularities (close to quotient singularities) for which we generalize the notion of a (analytic) fundamental class for an analytic cycle and also the notion of a relative fundamental c
lass for an analytic family of cycles. We also generalize to these spaces the geometric intersection theory for analytic cycles with rational positive coefficients and show that it behaves well with respect to analytic families of cycles. We prove that this intersection theory has most of the usual properties of the standard geometric intersection theory on complex manifolds, but with the exception that the intersection cycle of two cycles with positive integral coefficients that intersect properly may have rational coefficients. AMS classification. 32 C 20-32 C 25-32 C 36.
Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the corresponding code length is limited to the power of two. In this paper, we establish a systemati
c framework to design the rate-compatible punctured polar (RCPP) codes with arbitrary code length. A new theoretic tool, called polar spectra, is proposed to count the number of paths on the code tree with the same number of zeros or ones respectively. Furthermore, a spectrum distance SD0 (SD1) and a joint spectrum distance (JSD) are presented as performance criteria to optimize the puncturing tables. For the capacity-zero puncturing mode (punctured bits are unknown to the decoder), we propose a quasi-uniform puncturing algorithm, analyze the number of equivalent puncturings and prove that this scheme can maximize SD1 and JSD. Similarly, for the capacity-one mode (punctured bits are known to the decoder), we also devise a reversal quasi-uniform puncturing scheme and prove that it has the maximum SD0 and JSD. Both schemes have a universal puncturing table without any exhausted search. These optimal RCPP codes outperform the performance of turbo codes in LTE wireless communication systems.
We study distance spheres: the set of points lying at constant distance from a fixed arbitrary subset $K$ of $[0,1]^d$. We show that, away from the regions where $K$ is too dense and a set of small volume, we can decompose $[0,1]^d$ into a finite num
ber of sets on which the distance spheres can be straightened into subsets of parallel $(d-1)$-dimensional planes by a bi-Lipschitz map. Importantly, the number of sets and the bi-Lipschitz constants are independent of the set $K$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
