ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\geq1 be an integer, let log⁡2(n)\log_2(n) denote the binary logarithm of nn, and let ⌊log⁡2(n)⌋\lfloor\log_2(n)\rfloor be its integer part. For an ultrametric space (X,d)(X,d), let C(X)C(X) denote its center of distances. The center-of-distances cardinality conjecture. For every ultrametric space (X,d)(X,d) with ∣X∣=n|X|=n,

∣C(X)∣≤1+⌊log⁡2(n)⌋.|C(X)|\leq1+\lfloor\log_2(n)\rfloor.

Moreover, there exists an ultrametric space (Y,ρ)(Y,\rho) with ∣Y∣=n|Y|=n such that

∣C(Y)∣=1+⌊log⁡2(n)⌋.|C(Y)|=1+\lfloor\log_2(n)\rfloor.

This conjecture proposes a sharp logarithmic upper bound for the center of distances of finite ultrametric spaces; the source gives 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.