acceptodds
Preprint in the OpenAI Math release

Distortion of countably branching diamonds from midpoint and tree energies

OpenAI

Abstract

We derive quantitative distortion bounds for countably branching diamond graphs from midpoint estimates and direct tree energies. In the dual of a finite-height segment forest, every distortion-D embedding of the depth-k diamond satisfies . The same bound holds in the infinite-height coordinate predual. We also obtain power-type distortion bounds for path-cost and recursive tree norms.

open until 1 Jan 2028

est. 50% chance this result is independently verified by the end of 2027.

Not verified 50%Verified 50%

What do you think this paper will get?

All positions stay anonymous.

Discussion (0)

Sign in to comment.