Linear embeddings of Grassmannians and ind-Grassmannians
By a Grassmannian we understand a usual complex Grassmannian or possibly an orthogonal or symplectic Grassmannian. We classify, with few exceptions, linear embeddings of Grassmannians into larger Grassmannians, where the linearity requirement is the condition that the embedding induces an isomorphism on Picard groups. This classification implies that most linear embeddings of Grassmannians are equivariant. A linear ind-Grassmannian is the direct limit of a chain of linear embeddings of Grassmannians. We conclude the paper by classifying linear embeddings of linear ind-Grassmannians.
Authors
- Ivan Penkov
- Valdemar Tsanov
Institutions
- Constructor University (DE)
- Bulgarian Academy of Sciences (BG)
- Institute of Mathematics and Informatics (BG)
Publication Details
- Journal
- Journal of Lie Theory
- Published
- 2026-06-17
- DOI
- https://doi.org/10.5802/jlt.1425
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Deutsche Forschungsgemeinschaft
- Division of Mathematical Sciences