The combinatorial Jacobian conjecture
Statement
Fix an integer . For each , let be a collection of complex numbers, and let and denote the combinatorial quantities defined in the paper. The combinatorial Jacobian conjecture. There exists such that, for every , if
for all and with , then, for each , for all but finitely many . This is an equivalent combinatorial formulation of the Jacobian conjecture, encoding nilpotency conditions and polynomiality of the inverse through weighted sums over labelled trees.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.