The subtree shuffling conjecture
Statement
For integers and , let be the set of -Catalan trees with internal vertices, and let a length- shuffle class be the class obtained by rearranging the subtrees branching from an ancestral path of length . Write for the constant function and for the indicator of a shuffle class. The subtree shuffling conjecture. There exists an integer such that, for every ,
Equivalently, the indicator functions of the length- 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.