ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a positive integer. A winning kk-tactic for TWO is a strategy in which TWO's move depends only on the most recent kk moves of ONE. For a topological space (Xk,τk)(X_k,\tau_k), let BM(Xk,τk)BM(X_k,\tau_k) denote the Banach–Mazur game in which the players choose nonempty open sets satisfying

On+1⊆Tn⊆On.O_{n+1}\subseteq T_n\subseteq O_n.

Telgarsky's conjecture. For each positive integer kk there is a topological space (Xk,τk)(X_k,\tau_k) such that TWO does not have a winning kk-tactic, but does have a winning k+1k+1-tactic in the game BM(Xk,τk)BM(X_k,\tau_k). This conjecture asks whether the hierarchy of finite-memory tactics in the Banach–Mazur game is strict at every level. The paper notes that known examples do not settle the conjecture; in particular, its results eliminate one candidate example by showing that TWO has a winning 22-tactic there.

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.