atlas  0.6
Classes | Typedefs | Functions
atlas::standardrepk Namespace Reference

Classes

struct  bitset_entry
 
struct  Cartan_info
 per Cartan class information for handling |StandardRepK| values More...
 
class  graded_compare
 
class  HechtSchmid
 
class  KhatContext
 
struct  proj_info
 
class  PSalgebra
 
class  qKhatContext
 
class  SRK_context
 
class  StandardRepK
 Represents the restriction to $K$ of a (coherently) continued standard Harish-Chandra module. More...
 

Typedefs

typedef std::pair< Weight, RankFlagsHCParam
 
typedef Free_Abelian< StandardRepKChar
 
typedef std::pair< StandardRepK, CharCharForm
 
typedef std::pair< Weight, TitsElt > RawRep
 
typedef Free_Abelian< RawRepRawChar
 
typedef Free_Abelian< StandardRepK, Polynomial< int > > q_Char
 
typedef std::pair< StandardRepK, q_Charq_CharForm
 
typedef Free_Abelian< RawRep, Polynomial< int > > Raw_q_Char
 
typedef unsigned int seq_no
 
typedef unsigned int level
 
typedef Char::coef_t CharCoeff
 
typedef q_Char::coef_t q_CharCoeff
 
typedef Free_Abelian< seq_no, long int, graded_comparecombination
 
typedef std::pair< seq_no, combinationequation
 
typedef Free_Abelian< seq_no, q_CharCoeff, graded_compareq_combin
 
typedef std::pair< seq_no, q_combinq_equation
 

Functions

q_combin to_q (const combination &c)
 
q_Char to_q (const Char &chi)
 
template<typename C >
matrix::Matrix_base< C > triangularize (const std::vector< std::pair< seq_no, Free_Abelian< seq_no, C, graded_compare > > > &eq, std::vector< seq_no > &new_order)
 
template<typename C >
matrix::Matrix_base< C > inverse_lower_triangular (const matrix::Matrix_base< C > &L)
 
template matrix::Matrix_base< Polynomial< int > > triangularize (const std::vector< q_equation > &eq, std::vector< seq_no > &new_order)
 
template matrix::Matrix_base< Polynomial< int > > inverse_lower_triangular (const matrix::Matrix_base< Polynomial< int > > &L)
 
combination q_is_1 (const q_combin &c)
 
Char q_is_1 (const q_Char &chi)
 

Typedef Documentation

typedef Free_Abelian<StandardRepK> atlas::standardrepk::Char
typedef Char::coef_t atlas::standardrepk::CharCoeff
typedef Free_Abelian<seq_no,long int,graded_compare> atlas::standardrepk::combination
typedef unsigned int atlas::standardrepk::level
typedef Free_Abelian<StandardRepK,Polynomial<int> > atlas::standardrepk::q_Char
typedef q_Char::coef_t atlas::standardrepk::q_CharCoeff
typedef Free_Abelian<RawRep,Polynomial<int> > atlas::standardrepk::Raw_q_Char
typedef Free_Abelian<RawRep> atlas::standardrepk::RawChar
typedef std::pair<Weight,TitsElt> atlas::standardrepk::RawRep
typedef unsigned int atlas::standardrepk::seq_no

Function Documentation

template<typename C >
matrix::Matrix_base< C > atlas::standardrepk::inverse_lower_triangular ( const matrix::Matrix_base< C > &  L)
template matrix::Matrix_base<Polynomial<int> > atlas::standardrepk::inverse_lower_triangular ( const matrix::Matrix_base< Polynomial< int > > &  L)
combination atlas::standardrepk::q_is_1 ( const q_combin c)
Char atlas::standardrepk::q_is_1 ( const q_Char chi)
q_combin atlas::standardrepk::to_q ( const combination c)
q_Char atlas::standardrepk::to_q ( const Char chi)
template<typename C >
matrix::Matrix_base< C > atlas::standardrepk::triangularize ( const std::vector< std::pair< seq_no, Free_Abelian< seq_no, C, graded_compare > > > &  eq,
std::vector< seq_no > &  new_order 
)
template matrix::Matrix_base<Polynomial<int> > atlas::standardrepk::triangularize ( const std::vector< q_equation > &  eq,
std::vector< seq_no > &  new_order 
)