Polynomial-sized topological approximations using the permutahedron
type: Item
instance of: scholarly article
title: Polynomial-sized topological approximations using the permutahedron
zbMATH Open document ID: 1441.62937
author: Aruni Choudhary
author: Michael Kerber
author: Sharath Raghvendra
published in: Discrete \& Computational Geometry
publication date: 2019-04-25T00:00:00Z
Mathematics Subject Classification ID: 62R40
Mathematics Subject Classification ID: 55N31
Mathematics Subject Classification ID: 11H06
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7047916
zbMATH Keywords: persistent homology
zbMATH Keywords: topological data analysis
zbMATH Keywords: simplicial approximation
zbMATH Keywords: permutahedron
zbMATH Keywords: approximation algorithms
describes a project that uses: kepler98
describes a project that uses: CHomP
describes a project that uses: Sophia
MaRDI profile type: Publication
Wikidata QID: Q59602749
full work available at URL: s00454-017-9951-2
OpenAlex ID: W2769896813
cites work: Q5833535
cites work: Bernoulli's inequality
cites work: On the imbedding of systems of compacta in simplicial complexes
cites work: Approximating persistent homology in Euclidean space through collapses
cites work: On Lipschitz embedding of finite metric spaces in Hilbert space
cites work: Categorification of persistent homology
cites work: A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
cites work: Proximity of persistence modules and their diagrams
cites work: Polynomial-Sized Topological Approximations Using The Permutahedron
cites work: Q4039784
cites work: Computing Topological Persistence for Simplicial Maps
cites work: Q3655278
cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
cites work: A proof of the Kepler conjecture
cites work: Q3010463
cites work: Q4819371
cites work: Extensions of Lipschitz maps into Banach spaces
cites work: Barcodes of Towers and a Streaming Algorithm for Persistent Homology
cites work: Approximate Čech Complex in Low and High Dimensions
cites work: A simple randomized sieve algorithm for the closest-pair problem
cites work: Random walks in a convex body and an improved volume algorithm
cites work: Q3496912
cites work: Q3827224
cites work: On stirling numbers of the second kind
cites work: Linear-size approximations to the Vietoris-Rips filtration
cites work: The Persistent Homology of Distance Functions under Random Projection
cites work: Lectures on Polytopes
DOI: 10.1007/S00454-017-9951-2
description: scientific article; zbMATH DE number 7047916