Computational aspects of jacobian matrices
Foundations of Computational Mathematics, 1997
The underlying theme of this talk is the jacobian matrix of a (finite) set of multivariate polyno... more The underlying theme of this talk is the jacobian matrix of a (finite) set of multivariate polynomials f = {l1…-, lm} ⊂ R = k[X] = k[X1…,Xd]. Here k stands for a field, eventually of characteristic zero. Jacobian matrices are classical, useful in almost all branches of mathematics and there is a famous conjecture that bears the name! Is this enough reason to make them a central theme in a talk? Perhaps. The full justification here would go far beyond our modest purpose which is, namely, to convey their theoretical and computational usefulness in everyday commutative algebra and algebraic geometry.
Uploads
Papers by Aron Simis