2015
DOI: 10.1007/s10711-015-0053-0
|View full text |Cite
|
Sign up to set email alerts
|

Theorems of Barth-Lefschetz type and Morse theory on the space of paths in homogeneous spaces

Abstract: Homotopy connectedness theorems for complex submanifolds of homogeneous spaces (sometimes referred to as theorems of Barth-Lefshetz type) have been established by a number of authors. Morse Theory on the space of paths lead to an elegant proof of homotopy connectedness theorems for complex submanifolds of Hermitian symmetric spaces. In this work we extend this proof to a larger class of compact complex homogeneous spaces.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…The table below gives the range of values of ℓ for which the isomorphism between the Picard groups is satisfied (cf. Barth-Lefschetz-type theorems [16]):…”
Section: On a Results Of Ranmentioning
confidence: 99%
See 1 more Smart Citation
“…The table below gives the range of values of ℓ for which the isomorphism between the Picard groups is satisfied (cf. Barth-Lefschetz-type theorems [16]):…”
Section: On a Results Of Ranmentioning
confidence: 99%
“…However, in many situations and especially for subvarieties of rational homogeneous varieties and for zero loci of sections in vector bundles, the isomorphism holds with Z-coefficients (cf. Barth-Larsen's Lefschetz-type theorems [16]).…”
Section: Remark 13mentioning
confidence: 99%
“…We have to show that the direct summands are restrictions of line bundles on X that is, PicpXq Ñ PicpY q is surjective. This is the content of the Barth-Lefschetz criterion (see [19,20]): the restriction homomorphism is an isomorphism for 2 ď pℓ ´2q{2, where ℓ is the rank of G. l 3.1. A remark on Voisin's question.…”
Section: Proof Let Ymentioning
confidence: 99%