Title:  Winding Numbers and Simplicial Convex d-Polytopes

Abstract:  For a simplicial convex d-polytope, the winding number of a region counts how many times we wrap around that speci?fic region. It has been shown that the winding number is a nonnegative integer. While proving that the winding number is an integer is straightforward in all dimensions, showing that the winding number is nonnegative proves much more ?difficult for d>=3. In this talk, we will reference concrete examples as we prove that the winding number is a nonnegative integer for d=2.