The Jacobian Conjecture as a problem in combinatorics
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:JDRIX7D3record.jsonopen to challenge →
classification
math.CO
math.ACmath.AG
keywords
conjecturejacobiancasesymmetricgivehomogeneousalgebrabeen
read the original abstract
The Jacobian Conjecture has been reduced to the symmetric homogeneous case. In this paper we give an inversion formula for the symmetric case and relate it to a combinatoric structure called the Grossman-Larson Algebra. We use these tools to prove the symmetric Jacobian Conjecture for the case $F=X-H$ with $H$ homogeneous and $JH^{3}=0$. Other special results are also derived. We pose a combinatorial statement which would give a complete proof the Jacobian Conjecture.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.