By Topic

Solving the enumeration and word problems on Coxeter groups

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Perez-Perez, S.L. ; Comput. Sci. Dept., CINVESTAV-IPN, Mexico City, Mexico ; Morales-Luna, G.B. ; Sagols-Troncoso, F.D.

The word problem and indeed the enumeration problem in Coxeter groups are intractable in most cases. A direct way to solve the enumeration problem is by listing the canonical representatives of the equivalence classes, but this entails to solve the word problem for certain pairs of words in the group. We describe two methods to solve these problems and we analyze their complexity. We characterize two particular types of groups in which the word and the enumeration problems can efficiently be solved.

Published in:

Electrical Engineering Computing Science and Automatic Control (CCE), 2011 8th International Conference on

Date of Conference:

26-28 Oct. 2011