Abstract

Let S be a double occurrence word, and let M S be the word’s interlacement matrix, regarded as a matrix over GF ( 2 ) . Gauss addressed the question of which double occurrence words are realizable by generic closed curves in the plane. We reformulate answers given by Rosenstiehl and by de Fraysseix and Ossona de Mendez to give new graph-theoretic and algebraic characterizations of realizable words. Our algebraic characterization is especially pleasing: S is realizable if and only if there exists a diagonal matrix D S such that M S + D S is idempotent over GF ( 2 ) .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call