A Generalization of Matroid Intersection that can Test Singularity for a Class of Matrices

Given a matrix M with all its entries either elements of some field F or indeterminates that only appear once in the matrix, we give a deterministic polynomial-time algorithm that tests whether the determinant of M is identically zero.