### Random_Discrete_Morse

o level business studies past exam papers levitra brand cheap thesis design options file are there different types of viagra here essay on importance of moral values in our life art history term paper thesis ist viagra gefhrlich research paper over death salesman https://heystamford.com/writing/suggested-custom-writing-services/8/ a raisin in the sun summary essay on once more to lake click here source https://caberfaepeaks.com/school/hindi-essays-for-students-online/27/ https://www.nationalautismcenter.org/letter/sample-resume-format-for-canada/26/ essay on panic attacks https://ncappa.org/term/sample-essay-for-national-honor-society/4/ https://willcoxwinecountry.org/linkedin/get-help-with-dissertation/47/ https://abt.edu/bestsellers/peut-on-acheter-du-viagra-sans-ordonnance-en-belgique/22/ https://lawdegree.com/questions/iranian-newspapers-on-line/46/ malcolm x essay learning to read diferencias levitra y viagra essay writing formats essay on stereotype 1000 word essay on responsibility of youth nexium uscom https://vabf.org/reading/extended-essay-topics-in-chemistry/250/ follow url https://www.pugetsoundnavymuseum.org/paraphrasing/research-paper-on-the-history-of-the-nfl/24/ arizona immigration law sb1070 essay writing term paper follow site 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.