اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEmbeddings from noncompact symmetric spaces to their compact duals
95
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Every compact symmetric space $M$ admits a dual noncompact symmetric space $check{M}$. When $M$ is a generalized Grassmannian, we can view $check{M}$ as a open submanifold of it consisting of space-like subspaces cite{HL}. Motivated from this, we study the embeddings from noncompact symmetric spaces to their compact duals, including space-like embedding for generalized Grassmannians, Borel embedding for Hermitian symmetric spaces and the generalized embedding for symmetric R-spaces. We will compare these embeddings and describe their images using cut loci.
قيم البحث
اقرأ أيضاً
We describe the Morse groups of the nearby cycles sheaves on the nilcones in three classical symmetric spaces.
We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric embeddings of
higher rank symmetric spaces. In particular, we produce embeddings of $SL(n,mathbb R)$ into $Sp(2(n-1),mathbb R)$ when no isometric embeddings exist. A key ingredient in our proofs of rigidity results is a direct generalization of the Mostow-Morse Lemma in higher rank. Typically this lemma is replaced by the quasi-flat theorem which says that maximal quasi-flat is within bounded distance of a finite union of flats. We improve this by showing that the quasi-flat is in fact flat off of a subset of codimension $2$.
In this note, we consider the Dirac operator $D$ on a Riemannian symmetric space $M$ of noncompact type. Using representation theory we show that $D$ has point spectrum iff the $hat A$-genus of its compact dual does not vanish. In this case, if $M$ i
s irreducible then $M = U(p,q)/U(p) times U(q)$ with $p+q$ odd, and $Spec_p(D) = {0}$.
We establish a new symmetrization procedure for the isoperimetric problem in symmetric spaces of noncompact type. This symmetrization generalizes the well known Steiner symmetrization in euclidean space. In contrast to the classical construction the
symmetrized domain is obtained by solving a nonlinear elliptic equation of mean curvature type. We conclude the paper discussing possible applications to the isoperimetric problem in symmetric spaces of noncompact type.
Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P, where I is th
e incidence matrix of some graph and P is a binary matrix of rank at most r. Such matroids naturally appear in a number of theoretical and applied settings. The main motivation behind our work is an attempt to understand which parameterized algorithms for various problems on graphs could be lifted to perturbed graphic matroids. We study the parameterized complexity of a natural generalization (for matroids) of the following fundamental problems on graphs: Steiner Tree and Multiway Cut. In this generalization, called the Space Cover problem, we are given a binary matroid M with a ground set E, a set of terminals Tsubseteq E, and a non-negative integer k. The task is to decide whether T can be spanned by a subset of Esetminus T of size at most k. We prove that on graphic matroid perturbations, for every fixed r, Space Cover is fixed-parameter tractable parameterized by k. On the other hand, the problem becomes W[1]-hard when parameterized by r+k+|T| and it is NP-complete for rleq 2 and |T|leq 2. On cographic matroids, that are the duals of graphic matroids, Space Cover generalizes another fundamental and well-studied problem, namely Multiway Cut. We show that on the duals of perturbed graphic matroids the Space Cover problem is fixed-parameter tractable parameterized by r+k.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
