Papers
Topics
Authors
Recent
Search
2000 character limit reached

Morse Matchings on a Hypersimplex

Published 7 Nov 2012 in math.CO and math.GT | (1211.6483v1)

Abstract: We present a family of complete acyclic Morse matchings on the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. In a future paper we will utilize these matchings to classify every subcomplex whose reduced homology groups are concentrated in a single degree and describe a homology basis for each of them.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.