ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix an integer d≥3d\geq 3. For each n≥1n\geq 1, let H=(Hi,α:i∈[n],∣α∣=d)H=(H_{i,\alpha}:i\in[n],\lvert\alpha\rvert=d) be a collection of complex numbers, and let Ψi,jα(H)\Psi_{i,j}^{\alpha}(H) and Φiα(H)\Phi_i^{\alpha}(H) denote the combinatorial quantities defined in the paper. The combinatorial Jacobian conjecture. There exists d≥3d\geq 3 such that, for every n≥1n\geq 1, if

Ψi,jα(H)=0\Psi_{i,j}^{\alpha}(H)=0

for all i,j∈[n]i,j\in[n] and α∈Z≥0n\alpha\in\mathbb{Z}_{\geq 0}^n with ∣α∣=(d−1)n\lvert\alpha\rvert=(d-1)n, then, for each i∈[n]i\in[n], Φiα(H)=0\Phi_i^{\alpha}(H)=0 for all but finitely many α\alpha. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.