The large-canopy dimension conjecture for alternating-move games

From papers

Let TYT\subseteq \mathbb{Y} be a subtree, and write

d=\dim_{\mathcal{H}}\left(\left\llbracket T\right\rrbracket\right).

For d>12d>\frac{1}{2} and δ[12,d]\delta\in\left[\frac{1}{2},d\right], consider win-lose alternating-move games on TT with payoff sets contained in \left\llbracket T\right\rrbracket. Large-canopy dimension conjecture. There exist sets W,W^I,W^{II}\subseteq\left\llbracket T\right\rrbracket such that

dimH(W)=dimH(WI)=dimH(WII)=δ,\dim_{\mathcal{H}}(W)=\dim_{\mathcal{H}}(W^I)=\dim_{\mathcal{H}}(W^{II})=\delta,

where WW is non-determined, Player I can guarantee a win in the game GI=(T,WI)G_I=\left(T,W^I\right), and Player II can guarantee a win in the game GII=(T,WII)G_{II}=\left(T,W^{II}\right). This would extend the analogous result for the full tree to subtrees whose canopies have Hausdorff dimension greater than 12\frac{1}{2}, while the preceding examples show that the conclusion can fail when the canopy has dimension at most 12\frac{1}{2}.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Itamar Bellaïche and Auriel Rosenzweig, “Determining the Winner in Alternating-Move Games”, arXiv:2601.08359 (2026).

Solutions 0

No solutions have been posted yet.