The refined flow-series recursion conjecture
Statement
Let be a rooted tree, let be a vertex of , let be its parent, let be a rooted tree grafted at , and let and be the rooted trees defined by removing everything above and taking the subtree rooted at , respectively. Let and be rational functions associated with rooted trees, and let and denote the linear tree and corolla. Refined flow-series recursion conjecture. There exist rational functions such that
and such that
and
This conjecture seeks a parameterized refinement of the inductive identity for flow-generating series, with prescribed values on linear trees and corollas. The source provides no resolution status.
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.