Maximum cardinality of the center of distances of a finite ultrametric space

Let n1n\geq1 be an integer, let log2(n)\log_2(n) denote the binary logarithm of nn, and let log2(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+log2(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+log2(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.

Sources & referencesView supporting material

Primary source

Oleksiy Dovgoshey and Olga Rovenska, “Center of distances of ultrametric spaces generated by labeled trees”, arXiv:2601.13363 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.