ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a rooted tree, let vv be a vertex of TT, let uu be its parent, let ww be a rooted tree grafted at vv, and let SS and S′S' be the rooted trees defined by removing everything above vv and taking the subtree rooted at vv, respectively. Let FT,t\mathscr{F}_{T,t} and ET,t\mathscr{E}_{T,t} be rational functions associated with rooted trees, and let Lnr(n)\mathtt{Lnr}(n) and Crln\mathtt{Crl}_n denote the linear tree and corolla. Refined flow-series recursion conjecture. There exist rational functions FT,t\mathscr{F}_{T,t} such that

FT↶vw,t=FT↶uw,t+(1−t)FS,tFS′,t,\mathscr{F}_{T\curvearrowleft_v w,t}=\mathscr{F}_{T\curvearrowleft_u w,t}+(1-t)\mathscr{F}_{S,t}\mathscr{F}_{S',t},

and such that

FLnr(n),t=ELnr(n),tfor n≥1,\mathscr{F}_{\mathtt{Lnr}(n),t}=\mathscr{E}_{\mathtt{Lnr}(n),t}\qquad\text{for }n\geq1,

and

FCrln=b(−t)n−2(1−t)n−1for n≥2.\mathscr{F}_{\mathtt{Crl}_n}=\frac{b(-t)^{n-2}}{(1-t)^{n-1}}\qquad\text{for }n\geq2.

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 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.