On Euclidean Algorithms for oriented linear Grassmanians

Maxim Arnold, Oleg Karpenkov

In this paper we study Euclidean algorithms and the corresponding continued fractions for oriented linear Grassmanians $G(k,n)$. We propose two algorithms: Maximal Element Eliminat…