CoxIter
1.2
CoxIter  Computing invariants of hyperbolic Coxeter groups

To compute the growth rate. More...
#include <growthrate.h>
Public Member Functions  
GrowthRate ()  
~GrowthRate ()  
GrowthRate_Result  grrComputations (vector< mpz_class > iPolynomial, const bool &bOnlyGrowthRate=false) 
Private Member Functions  
void  irreducibleFactors (const vector< mpz_class > &iPolynomial) 
void  minimalRoot () 
long int  iNumberRootsUnitCircle (GEN gPol) 
Private Attributes  
vector< GEN >  t_POLfactors 
Irreducible factors of the denominator of the growth series (only those having a root between 0 and 1) More...  
GEN  gGrowthRate 
Maximal positive root of the polynomial. More...  
GEN  gMaximalRoots 
Roots of the polynomial which has the maximal root. More...  
long int  iIndexMaximalRoot 
Factor which contains the minimal root. More...  
GEN  gEpsilon 
Some small number (typically 10^50) More...  
long int  iPariPrecision 
Given as prec (typically 8) More...  
To compute the growth rate.
To compute the signature of a matrix (PARI format)
GrowthRate::GrowthRate  (  ) 
GrowthRate::~GrowthRate  (  ) 
GrowthRate_Result GrowthRate::grrComputations  (  vector< mpz_class >  iPolynomial, 
const bool &  bOnlyGrowthRate = false 

) 

private 
For a palindromic polynomial, try to compute the number of zeros on the unit circle
gPol  (GEN, PARI polynomial) 

private 
Factor the polynomial iPolynomial and store the factors into t_POLfactors
iPolynomial(  vector< mpz_class > ) The polynomial (coefficients in GMPlib) 

private 
Find which fact has the smallest (positive, <1) real root and store the index into iIndexMinimalRoot

private 
Some small number (typically 10^50)

private 
Maximal positive root of the polynomial.

private 
Roots of the polynomial which has the maximal root.

private 
Factor which contains the minimal root.

private 
Given as prec (typically 8)

private 
Irreducible factors of the denominator of the growth series (only those having a root between 0 and 1)