Random Simple-Homotopy Theory

07/21/2021
by   Bruno Benedetti, et al.
0

We implement an algorithm RSHT (Random Simple-Homotopy) to study the simple-homotopy types of simplicial complexes, with a particular focus on contractible spaces and on finding substructures in higher-dimensional complexes. The algorithm combines elementary simplicial collapses with pure elementary expansions. For triangulated d-manifolds with d < 7, we show that RSHT reduces to (random) bistellar flips. Among the many examples on which we test RSHT, we describe an explicit 15-vertex triangulation of the Abalone, and more generally, (14k+1)-vertex triangulations of Bing's houses with k rooms, which all can be deformed to a point using only six pure elementary expansions.

READ FULL TEXT
research
12/24/2019

A note on the elementary HDX construction of Kaufman-Oppenheim

In this note, we give a self-contained and elementary proof of the eleme...
research
12/01/2017

An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation

We give an elementary proof of the fact that a binomial random variable ...
research
10/21/2019

Parametrized Complexity of Expansion Height

Deciding whether two simplicial complexes are homotopy equivalent is a f...
research
03/16/2022

An elementary analysis of ridge regression with random design

In this note, we provide an elementary analysis of the prediction error ...
research
10/12/2021

Poncelet Parabola Pirouettes

We describe some three-dozen curious phenomena manifested by parabolas i...
research
07/26/2019

FAKIR : An algorithm for estimating the pose and elementary anatomy of archaeological statues

The digitization of archaeological artefacts has become an essential par...
research
09/06/2013

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

We provide an elementary proof of a simple, efficient algorithm for comp...

Please sign up or login with your details

Forgot password? Click here to reset