All Questions
4 questions
5
votes
1
answer
908
views
Finding a basis for the (linear combinations) span of a matrix group, efficiently?
I have an algorithm whose bottleneck is the following task:
Let $\mathbb{F}$ be a finite field.
Given a set of $k$ invertible matrices $g_1,\dots,g_k\in GL_n(\mathbb{F})$, let
$G=\langle g_1,\dots,...
4
votes
0
answers
806
views
(Co)limit computations for diagrams of Vector Spaces
Fix a field $K$ and consider a finite directed graph $\Gamma$ where multiple edges between a pair of vertices are allowed so long as the total number of edges is finite. Associate to each vertex $v$ a ...
3
votes
2
answers
501
views
Lattice reduction on an orthonormal lattice?
Suppose you are given an inner product on a vector space and given a set of linearly independent vectors, and that you have been promised that the lattice they span has an orthonormal basis. Can you (...
1
vote
2
answers
491
views
Simultaneous Smith Normalization of a Composable Matrix Sequence
Let $\mathsf{R}$ be a PID and consider a collection of free, finitely generated $\mathsf{R}$-modules $V_1,\ldots,V_n$ along with module maps $m_j:V_j \to V_{j+1}$. That is, we have the following ...