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.

Publication Details

Journal
ArXiv.org
Published
2025-03-25
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Linear embeddings of grassmannians and ind-grassmannians

ArXiv.org
Matrix Theory and Algorithms
article

Linear embeddings of grassmannians and ind-grassmannians

article en

Abstract

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.

ArXiv.org
Openalex Percentile: Top 48%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Linear embeddings of grassmannians and ind-grassmannians · ArXiv.org (2025) | TGRS Research Map | TGRS