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

zbMath1226.05253MaRDI QIDQ1028820

Dan Singer

Publication date: 8 July 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117506

zbMATH Keywords

spanning set of vectors for a finite-dimensional vector space

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Jacobian problem (14R15) Graph theory (05C99) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (1)

Faà di Bruno's formula and inversion of power series

This page was built for publication: 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