ThRightNormalFormAlgorithms.h File Reference

#include "set"
#include "ThRightNormalForm.h"

Go to the source code of this file.

Functions
pair< vector< ThRightNormalForm >, ThRightNormalForm >	getSummitSetRepresentative (int rank, const vector< ThRightNormalForm > &elts)
	Compute summit set representatives for a tuple of braids.
Permutation	getSimpleConjugator (int rank, const vector< ThRightNormalForm > &tuple, const Permutation &start)
	Compute a simple conjugator for "tuple" starting from "start".
set< Permutation >	getSimpleConjugators (int rank, const vector< ThRightNormalForm > &tuple)

---

Function Documentation

Permutation getSimpleConjugator (  int  rank, const vector< ThRightNormalForm > &  tuple, const Permutation &  start )

Compute a simple conjugator for "tuple" starting from "start". Algorithm from Gonzalez-Menese, "Improving an algorithm to solve Multiple Simultaneous Conjugacy problem for braid groups". Conjugating by a simple element does not decrease the infimum of the tuple.

set< Permutation > getSimpleConjugators (  int  rank, const vector< ThRightNormalForm > &  tuple )

pair< vector< ThRightNormalForm > , ThRightNormalForm > getSummitSetRepresentative (  int  rank, const vector< ThRightNormalForm > &  elts )

Compute summit set representatives for a tuple of braids.

---