Search Results
MA 724 Combinatorics II
惭础听724听听Combinatorics II听听(3 credit hours)听听
Polytopes(V-polytopes and H-polytopes). Fourier-Motzkin elimination, Farkas Lemma, face numbers of polytopes, graphs of polytopes, linear programming for geometers, Balinski's Theorem, Steinitz' Theorem, Schlegel diagrams, polyhedral complexes, shellability, and face rings.
Prerequisite: 惭础听524
Typically offered in Spring only