A polynomial complexity algorithm reduces vector bundle transition matrices on real anisotropic conics to canonical block diagonal forms and proves their decomposition into rank-at-most-2 indecomposables.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An algorithmic reduction to canonical forms for vector bundles on anisotropic conics
A polynomial complexity algorithm reduces vector bundle transition matrices on real anisotropic conics to canonical block diagonal forms and proves their decomposition into rank-at-most-2 indecomposables.