Least distortion Euclidean embeddings of flat tori
From MaRDI portal
Publication:6060342
DOI10.1145/3597066.3597147OpenAlexW4383213610MaRDI QIDQ6060342
Frank Vallentin, Philippe Moustrou
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3597066.3597147
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Euclidean distortion of generalized polygons
- Geometric algorithms and combinatorial optimization
- Spherical codes and designs
- Girth and Euclidean distortion
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders
- The geometry of graphs and some of its algorithmic applications
- The least Euclidean distortion constant of a distance-regular graph
- Optimal distortion embeddings of distance regular graphs into Euclidean spaces
- Nonembeddability theorems via Fourier analysis
- On polarization of spherical codes and designs
- Invariant Semidefinite Programs
- On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming
- Universally optimal distribution of points on spheres
- Covering a sphere and extremal properties of orthogonal polynomials
- The Restricted Isometry Property of Subsampled Fourier Matrices
- Euclidean distortion and the sparsest cut
- Simultaneous Packing and Covering in Euclidean Space
This page was built for publication: Least distortion Euclidean embeddings of flat tori