Changes

shows that there are indeed a very few evaluations with zero determinant for a nonsingular matrix). For the Tutte-matrix, Geelen<ref>J. Geelen, An algebraic matching algorithm,

Combinatorica 20, pp 61-70 (2000) [http://dx.doi.org/10.1007/s004930070031 DOI link] [http://www.math.uwaterloo.ca/~jfgeelen/publications/match.ps PS]</ref> gave a deterministic polynomial-time algorithm.

==Linear polynomials==

==Rigidity==

Polynomial matrices play an utterly important in the field of [[rigidity]]. Indeed, the notion of '''generical rigidity''' in ''d'' dimensions is defined by the rank of the [[rigidity matrix]], which is a polynomial matrix. Two dimensional generical rigidity is a well-understood property admitting a graph theoretic description, however the characterization of [[generical rigidity in three dimensions]] is a major open question in the field.