ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Every tree metric with tt leaves embeds isometrically into ℓ∞t−1\ell_\infty^{t-1}, and the least dimension needed is at least ⌈log⁡2t⌉\lceil \log_2 t \rceil. Fitzpatrick and Nowakowski asked in 2000 whether the logarithmic bound is always attained, and Brigham, Chartrand, Dutton and Zhang conjectured in 2005 that every tree with tt leaves embeds isometrically into ℓ∞⌈log⁡2t⌉\ell_\infty^{\lceil \log_2 t \rceil}, verifying it through t=21t = 21. Aksoy, Kilic and Kocak posed a sharp leaf-threshold version for weighted metric trees in 2020.

Record

Added
Links

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.