### Abstract

We present extremal constructions connected with the property of simplicial collapsibility. (1) For each (Formula presented.), there are collapsible (and shellable) simplicial d-complexes with only one free face. Also, there are non-evasive d-complexes with only two free faces (both results are optimal in all dimensions). (2) Optimal discrete Morse vectors need not be unique. We explicitly construct a contractible, but non-collapsible 3-dimensional simplicial complex with face vector (Formula presented.) that admits two distinct optimal discrete Morse vectors, (1, 1, 1, 0) and (1, 0, 1, 1). Indeed, we show that in every dimension (Formula presented.) there are contractible, non-collapsible simplicial d-complexes that have (Formula presented.) and (Formula presented.) as distinct optimal discrete Morse vectors. (3) We give a first explicit example of a (non-PL) 5-manifold, with face vector (Formula presented.) 495912, 383136, 110880), that is collapsible but not homeomorphic to a ball. Furthermore, we discuss possible improvements and drawbacks of random approaches to collapsibility and discrete Morse theory. We will introduce randomized versions random-lex-first and random-lex-last of the lex-first and lex-last discrete Morse strategies of Benedetti and Lutz (Exp Math 23(1):66–94, 2014), respectively—and we will see that in many instances the random-lex-last strategy works significantly better than Benedetti–Lutz’s (uniform) random strategy. On the theoretical side, we prove that after repeated barycentric subdivisions, the discrete Morse vectors found by randomized algorithms have, on average, an exponential (in the number of barycentric subdivisions) number of critical cells asymptotically almost surely.

Original language | English (US) |
---|---|

Pages (from-to) | 1-30 |

Number of pages | 30 |

Journal | Discrete and Computational Geometry |

DOIs | |

State | Accepted/In press - Feb 17 2017 |

### Fingerprint

### Keywords

- Collapsibility
- Library of triangulations
- Random discrete Morse theory
- Shellability

### ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

### Cite this

*Discrete and Computational Geometry*, 1-30. https://doi.org/10.1007/s00454-017-9860-4

**Extremal Examples of Collapsible Complexes and Random Discrete Morse Theory.** / Adiprasito, Karim A.; Benedetti, Bruno; Lutz, Frank H.

Research output: Contribution to journal › Article

*Discrete and Computational Geometry*, pp. 1-30. https://doi.org/10.1007/s00454-017-9860-4

}

TY - JOUR

T1 - Extremal Examples of Collapsible Complexes and Random Discrete Morse Theory

AU - Adiprasito, Karim A.

AU - Benedetti, Bruno

AU - Lutz, Frank H.

PY - 2017/2/17

Y1 - 2017/2/17

N2 - We present extremal constructions connected with the property of simplicial collapsibility. (1) For each (Formula presented.), there are collapsible (and shellable) simplicial d-complexes with only one free face. Also, there are non-evasive d-complexes with only two free faces (both results are optimal in all dimensions). (2) Optimal discrete Morse vectors need not be unique. We explicitly construct a contractible, but non-collapsible 3-dimensional simplicial complex with face vector (Formula presented.) that admits two distinct optimal discrete Morse vectors, (1, 1, 1, 0) and (1, 0, 1, 1). Indeed, we show that in every dimension (Formula presented.) there are contractible, non-collapsible simplicial d-complexes that have (Formula presented.) and (Formula presented.) as distinct optimal discrete Morse vectors. (3) We give a first explicit example of a (non-PL) 5-manifold, with face vector (Formula presented.) 495912, 383136, 110880), that is collapsible but not homeomorphic to a ball. Furthermore, we discuss possible improvements and drawbacks of random approaches to collapsibility and discrete Morse theory. We will introduce randomized versions random-lex-first and random-lex-last of the lex-first and lex-last discrete Morse strategies of Benedetti and Lutz (Exp Math 23(1):66–94, 2014), respectively—and we will see that in many instances the random-lex-last strategy works significantly better than Benedetti–Lutz’s (uniform) random strategy. On the theoretical side, we prove that after repeated barycentric subdivisions, the discrete Morse vectors found by randomized algorithms have, on average, an exponential (in the number of barycentric subdivisions) number of critical cells asymptotically almost surely.

AB - We present extremal constructions connected with the property of simplicial collapsibility. (1) For each (Formula presented.), there are collapsible (and shellable) simplicial d-complexes with only one free face. Also, there are non-evasive d-complexes with only two free faces (both results are optimal in all dimensions). (2) Optimal discrete Morse vectors need not be unique. We explicitly construct a contractible, but non-collapsible 3-dimensional simplicial complex with face vector (Formula presented.) that admits two distinct optimal discrete Morse vectors, (1, 1, 1, 0) and (1, 0, 1, 1). Indeed, we show that in every dimension (Formula presented.) there are contractible, non-collapsible simplicial d-complexes that have (Formula presented.) and (Formula presented.) as distinct optimal discrete Morse vectors. (3) We give a first explicit example of a (non-PL) 5-manifold, with face vector (Formula presented.) 495912, 383136, 110880), that is collapsible but not homeomorphic to a ball. Furthermore, we discuss possible improvements and drawbacks of random approaches to collapsibility and discrete Morse theory. We will introduce randomized versions random-lex-first and random-lex-last of the lex-first and lex-last discrete Morse strategies of Benedetti and Lutz (Exp Math 23(1):66–94, 2014), respectively—and we will see that in many instances the random-lex-last strategy works significantly better than Benedetti–Lutz’s (uniform) random strategy. On the theoretical side, we prove that after repeated barycentric subdivisions, the discrete Morse vectors found by randomized algorithms have, on average, an exponential (in the number of barycentric subdivisions) number of critical cells asymptotically almost surely.

KW - Collapsibility

KW - Library of triangulations

KW - Random discrete Morse theory

KW - Shellability

UR - http://www.scopus.com/inward/record.url?scp=85013074610&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013074610&partnerID=8YFLogxK

U2 - 10.1007/s00454-017-9860-4

DO - 10.1007/s00454-017-9860-4

M3 - Article

AN - SCOPUS:85013074610

SP - 1

EP - 30

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

ER -