ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A game space is a compact geodesic metric space equipped with the Cops and Robber game. Its doubling constant is the least k∈N∪{∞}k\in\mathbb{N}\cup\{\infty\} such that every ball B(x,r)B(x,r) can be covered by at most kk balls of radius r/2r/2. The doubling conjecture. If XX is a game space with finite doubling constant, then

c(X)<∞.c(X)<\infty.

This is posed among the paper's open problems connecting cop number with classical metric properties; the source gives no resolution.

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.