DeepAI AI Chat
Log In Sign Up

Random Simple-Homotopy Theory

by   Bruno Benedetti, et al.

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.


A note on the elementary HDX construction of Kaufman-Oppenheim

In this note, we give a self-contained and elementary proof of the eleme...

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 ...

Parametrized Complexity of Expansion Height

Deciding whether two simplicial complexes are homotopy equivalent is a f...

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

The digitization of archaeological artefacts has become an essential par...

Poncelet Parabola Pirouettes

We describe some three-dozen curious phenomena manifested by parabolas i...

An elementary analysis of ridge regression with random design

In this note, we provide an elementary analysis of the prediction error ...

A short note on Goppa codes over Elementary Abelian p-Extensions of F_p^s(x)

In this note, we investigate Goppa codes which are constructed by means ...