Basis Enumeration of Hyperplane Arrangements up to Symmetries

Basis Enumeration of Hyperplane Arrangements up to Symmetries

This thesis details a method of enumerating bases of hyperplane arrangements up to symmetries. I consider here automorphisms, geometric symmetries which leave the set of all points contained in the arrangement setwise invariant. The algorithm for basis enumeration described in this thesis is a backt...

Full description

Bibliographic Details
Main Author: Moss, Aaron
Other Authors: University of New Brunswick, Faculty of Computer Science
Language:en
Published: Fredericton: University of New Brunswick 2012
Subjects:
basis enumeration
hyperplane arrangement
simplex method
automorphism
isometry
Online Access:http://hdl.handle.net/1882/44593

Internet

http://hdl.handle.net/1882/44593

Similar Items