A combinatorial algorithm for visualizing representatives with minimal self-intersection

Details A combinatorial algorithm for visualizing representatives with minimal self-intersection A combinatorial algorithm for visualizing representatives with minimal self-intersection

2011-01-29

arxiv.org/abs/1101.5658v1

Mathematics

Geometric Topology

14 pages, 11 figures. The algorithm described in the paper is implemented at http://www.math.sunysb.edu/~moira/applets/chrisAp

Scientific paper

Given an orientable surface with boundary and a free homotopy class, we
present a purely combinatorial algorithm which produces a representative of
that homotopy class with minimal self intersection.

Affiliated with

Also associated with

No associations

Rating

A combinatorial algorithm for visualizing representatives with minimal self-intersection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A combinatorial algorithm for visualizing representatives with minimal self-intersection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A combinatorial algorithm for visualizing representatives with minimal self-intersection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572169