Quantitative embeddings with applications
Name
portnoy-eportnoy-phd-math-2025-thesis.pdf
Description
Thesis PDF
Size
724.79 KB
Format
Adobe PDF
Checksum (MD5)
9dbff718fa907bd9a7255e0910d232f2
Author(s)
Portnoy, Elia
Advisor(s)
Guth, Lawrence
Date Issued
May 2025
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis, we discuss quantitative embeddings that generalize a theorem of Kolmogorov and Barzdin. The theorem says that any bounded degree graph with V vertices can be mapped into a 3-dimensional ball of radius sqrt(V), so that at most a constant number of edges intersect any unit ball. In one generalization we describe how much freedom we have in placing the vertices of the graph, and in the other we prove a similar result for simplicial complexes of any dimension. We also discuss applications of these quantitative embeddings to a problem in metric geometry related to the isoperimetric inequality and a problem about constructing local quantum error-correcting codes.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Copyright retained by author(s)
Persistent DSpace Link
