A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture.
Singer, Dan
The Electronic Journal of Combinatorics [electronic only], Tome 16 (2009), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2009-01-01
EUDML-ID : urn:eudml:doc:117506 
@article{05576424,
     title = {A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {16},
     year = {2009},
     zbl = {1226.05253},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05576424}
}

Singer, Dan. A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture.. The Electronic Journal of Combinatorics [electronic only], Tome 16 (2009) . http://gdmltest.u-ga.fr/item/05576424/