1
$\begingroup$

Given a generating set of a $\mathbb{Z}$-module $M \subseteq {\mathbb{Z}_k}^n$, is there a known algorithm to compute a generating set of $\{u \in {\mathbb{Z}_k}^n \, : \, \forall v \in M \quad v \cdot u = 0\}$?

  • 0
    This question has been cross-posted on MathOverflow: ttp://mathoverflow.net/questions?sort=newest2011-09-06

0 Answers 0