17 problems
characterization conjecture. The following statements are equivalent:
Four-point obstruction conjecture. The following statements are equivalent:
Let be an infinite ultrametric space. A metric space is weakly similar to another when there is a similarity between them, allowing a positive rescaling of distances. Infin…
Let be a finite ordinal space and let . For a subset , write when the induced ordinal space on embeds…
Let be an ordinal space with , and let be an enumeration of its points satisfying the majorization property. Write…
Low-dimensional special linear group conjecture. For every prime power there exist and positive constants ,…
Special linear group Euclidean distortion conjecture. For every and every prime power ,
Finite-dimensional snowflake embedding conjecture. For every , there exists such that, for every integer , the…
Let be an -point metric space. For , a bi-Lipschitz distortion- embedding of into a metric space means an embeddin…
Let be a subset with . An embedding of into a normed space has distortion if distances are preserved up to a multip…
Let be a finite set of graphs. A graph excludes as a minor if it contains no member of as a minor, where minors are obtained by edge contractions, edge deletions, and v…
A planar graph metric is a shortest-path metric on a finite planar graph whose edges have arbitrary weights. The Planar Conjecture. Every metric supported on a finite planar graph…
For and , let denote the -dimensional integer grid with its metric, and let be its least bi-Lipschitz distortion in…
-sum embedding conjecture. For any family of graphs , we have
GNRS conjecture. For every family of finite graphs , one has if and only if forbids some minor.
Let be the discrete Heisenberg group, let be its radius- ball with the word metric , and let denote the least distortion of an embedding of…
Gupta–Newman–Rabinovich–Sinclair conjecture. For every family of finite graphs , one has