#include "weyl.h"
#include <algorithm>
#include <set>
#include <stack>
#include "dynkin.h"
#include "setutils.h"
#include "rootdata.h"
Include dependency graph for weyl.cpp:

Go to the source code of this file.
Namespaces | |
| namespace | atlas |
| namespace | atlas::weyl |
Functions | |
| void | fillCoxMatrix (LatticeMatrix &, const LatticeMatrix &, const Permutation &) |
| EltPiece | dihedralMin (const Transducer &, EltPiece, Generator, Generator) |
| EltPiece | dihedralShift (const Transducer &, EltPiece, Generator, Generator, unsigned long) |
| EltPiece | dihedralMin (const Transducer &qa, EltPiece x, Generator s, Generator t) |
| Returns the minimal element in the orbit of x under s and t. | |
| EltPiece | dihedralShift (const Transducer &qa, EltPiece x, Generator s, Generator t, unsigned long d) |
| Returns the result of applying s and t alternately to x, for a total of d times. | |
| void | fillCoxMatrix (LatticeMatrix &cox, const LatticeMatrix &cart, const Permutation &a) |
| Fills in the Coxeter matrix cox. | |
I have decided to represent elements as fixed-size arrays of unsigned characters. This forces expressing things in the standard ordering of the generators, and hence to have a small i/o interface for resetting the numbering to and from the numbering used by the outside world.
It has seemed to me that this is the best compromise between size of the dataype, generality and efficiency.
Definition in file weyl.cpp.
|
||||||||||||||||||||
|
Returns the minimal element in the orbit of x under s and t. Precondition : s is in the descent set of x; Definition at line 983 of file weyl.cpp. References atlas::weyl::EltPiece, atlas::weyl::Generator, and atlas::weyl::Transducer::shift(). |
|
||||||||||||||||||||
|
Referenced by atlas::weyl::Transducer::Transducer(). |
|
||||||||||||||||||||||||
|
Returns the result of applying s and t alternately to x, for a total of d times.
Definition at line 1008 of file weyl.cpp. References atlas::weyl::EltPiece, atlas::weyl::Generator, and atlas::weyl::Transducer::shift(). |
|
||||||||||||||||||||||||
|
Referenced by atlas::weyl::Transducer::Transducer(). |
|
||||||||||||||||
|
Fills in the Coxeter matrix cox. Precondition: cart is a Cartan matrix; a holds a normalizing permutation for cart, such as constructed by normalize(a,d) where d is the Dynkin diagram of cart (declared in dynkin.h); Postcondition : cox holds the normalized Coxeter matrix corresponding to cox and a; Definition at line 1030 of file weyl.cpp. References atlas::latticetypes::LatticeMatrix, atlas::matrix::Matrix< C >::numColumns(), atlas::matrix::Matrix< C >::numRows(), atlas::matrix::Matrix< C >::permute(), and atlas::matrix::Matrix< C >::resize(). |
|
||||||||||||||||
|
Referenced by atlas::weyl::WeylGroup::WeylGroup(). |
1.3.9.1