### Random_Discrete_Morse

see url https://www.thehasse.org/does/efectos-de-media-viagra/45/ go https://www.arvadachamber.org/verified/creative-writing-in-delhi/49/ 2013 no essay scholarships juniors online essay help viagra legal deutschland kaufen discount bulk viagra india enter site how to make viagra at home youtube invitation letter writing alternatives to doxycycline for acne al gas marinas donde comprar viagra https://albionfoundation.org/perpill/viagra-day-after/63/ get link https://zsjnm.huc.edu/analytical/example-of-conceptual-framework-in-thesis/2/ sample thesis for master in public administration in the philippines cialis and blue vision could pressure from taking viagra cause eyefloaters essay idea persuasive topic how to use sildenafil 50 mg follow site viagra and stomach acid how to write an essay for toefl ibt preo do cialis 20 mg no brasil go to link samples persuasive essays cheap argumentative essay writer for hire for university impact of computer to society take sildenafil on empty stomach The random_discrete_morse client in polymake is a C++ (and therefore FAST) implementation of Bruno Benedetti and Frank Lutz’s algorithm. Read more about it here.

This project was joint work with Frank Lutz and Michael Joswig.

### bistellar_simplification

The bistellar_simplification client in polymake uses a simulated annealing technique to determine the PL type of a simplicial complex. Read more about it here.

### dgCat: Discrete Geometric Category

Let [latex]K[/latex] be a simplicial complex and suppose that [latex]K[/latex] collapses onto [latex]L[/latex]. Define [latex]n[/latex] to be 1 less than the minimum number of collapsible sets it takes to cover [latex]L[/latex]. Then the discrete Lusternik-Schnirelmann category of [latex]K[/latex] is the smallest [latex]n[/latex] taken over all such [latex]L[/latex]. dgCat is an implementation of an algorithm which yields an upper bound for the discrete category. Read more about it here.

This project was joint work with Nicholas Scoville and Brian Green.