Relating a counting algorithm to the Jacobian conjecture

MaRDI QIDQ4911375zbMATH OpenFDO

Authors Kristen A. Lampe

Publication date 14 March 2013

Full work available at URL http://www.ijpam.eu/contents/2012-80-4/5/index.html

zbMATH Keywords

counting formulaforestsJacobian conjecturepolynomialsreversiontrees

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Polynomials over commutative rings (13B25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Recommendations

• Formal inverse expansion and the Jacobian conjecture
• The Jacobian Conjecture as a problem in combinatorics
• Inverse degrees and the Jacobian conjecture
• A new formulation of the Jacobian conjecture in characteristic p
• An effective study of polynomial maps

Cited in

(1)

• A counting formula for labeled, rooted forests

This page was built for publication: Relating a counting algorithm to the Jacobian conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911375)