Enumerating invariant subspaces of R^n
From MaRDI portal
Publication:445848
Abstract: In this article, we develop an algorithm to calculate the set of all integers for which there exists a linear operator on such that has exactly -invariant subspaces. A brief discussion is included as how these methods might be extended to vector spaces over arbitrary fields.
Recommendations
- The number of invariant subspaces under a linear operator on finite vector spaces
- On rational calculation of the invariant subspaces of a complex matrix
- The common invariant subspace problem: an approach via Gröbner bases
- What kind of operators have few invariant subspaces?
- scientific article; zbMATH DE number 7593729
Cites work
Cited in
(6)- Enumeration of subspaces by dimension sequence
- On rational calculation of the invariant subspaces of a complex matrix
- Splitting subspaces of linear operators over finite fields
- Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields
- Constructing invariant subspaces as kernels of commuting matrices
- The number of linear transformations defined on a subspace with given invariant factors
This page was built for publication: Enumerating invariant subspaces of \(\mathbb R^{n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445848)