ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers d≥2d\geq 2 and p≥1p\geq 1, let Ck(d)\mathcal{C}_k^{(d)} be the set of dd-Catalan trees with kk internal vertices, and let a length-pp shuffle class be the class obtained by rearranging the subtrees branching from an ancestral path of length pp. Write 1\mathbf{1} for the constant function and 1S\mathbf{1}_{\mathcal{S}} for the indicator of a shuffle class. The subtree shuffling conjecture. There exists an integer k0(d,p)k_0(d,p) such that, for every k≥k0(d,p)k\geq k_0(d,p),

1∈span⁡{1S:S is a length-p shuffle class in Ck(d)}.\mathbf{1}\in\operatorname{span}\{\mathbf{1}_{\mathcal{S}}:\mathcal{S}\text{ is a length-}p\text{ shuffle class in }\mathcal{C}_k^{(d)}\}.

Equivalently, the indicator functions of the length-pp shuffle classes span the constant function on the tree space. The conjecture is introduced as a combinatorial simplification of the Jacobian conjecture; the paper proves that it would imply the Jacobian conjecture and establishes an approximate version, but does not resolve the exact statement.

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.