Built on

Nothing clear enough to list yet.

Similar

O. Goldreich: Basic Facts about Expander Graphs; In: O. Goldreich, Studies in Complexity and Cryptography
Cited in the paper.
P. Papasoglu, E. Swenson: A sphere hard to cut, arXiv:1509.02307
Original
Cited in the paper.

Nothing clear enough to list yet.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…

Reading the bibliography…

2022

Berdnikov, Aleksandr

We construct embeddings of simplicial complexes into a (surface of a) simplicial ball whose triangulation has bounded degrees and low volume.

This construction can be used either to efficiently "simplify a complicated space" by realizing it as a part of a ball/sphere, or to "complexify" a sphere - to give it a specific metric that inherits desired properties from an embedded complex.

Nothing clear enough to list yet.

O. Goldreich: Basic Facts about Expander Graphs; In: O. Goldreich, Studies in Complexity and Cryptography
Cited in the paper.
P. Papasoglu, E. Swenson: A sphere hard to cut, arXiv:1509.02307
Original
Cited in the paper.

Nothing clear enough to list yet.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…