homfinder.H

#ifndef _HOMFINDER_H_
#define _HOMFINDER_H_

#include "algebras.H"
#include "matrix.H"
#include "my_gmp.H"
#include "ftwo.H"
#include <string>
using namespace std;




class HomFinder {
private:
  list< Matrix<F_2> > GL;
  list< long > basic_variables;
  list< long > target_basic_variables;
  list< long > higher_variables;
  list< long > polvars;
  map< long, Tuple< Polynomial<F_2> > > monomials;
  ZZ possibilities;

  GradedAlgebra<F_2> basic_source;
  list< Polynomial<F_2> > higher_relations;
  AffineHomomorphism<F_2> f;
 

  ZZ populate_GL(long n);

  ZZ filter_GL();

  void set_hom_from_matrix(AffineHomomorphism<F_2>& phi,
                           const list< long >& basics,
                           const Matrix<F_2>& M); 
  void set_f_from_matrix(const Matrix<F_2>& M);  
  void set_f_from_integer(ZZ code);

  void branch(const AffineHomomorphism<F_2>& phi,
              list< Polynomial<F_2> >::iterator next, 
              long depth);


public:
  bool verbose, very_verbose;
  GradedAlgebra<F_2> *source;
  const GradedAlgebra<F_2> *target;
  list< AffineHomomorphism<F_2> > solutions;

  ZZ solution_count;
    
  HomFinder();
  HomFinder(GradedAlgebra<F_2> *thesource, GradedAlgebra<F_2> *thetarget);
  void read_solutions_from(ifstream& file);
  void write_solutions_to(ofstream& file);

  void init();

  void start();

  void define_polynomial_variables();

  void define_polynomial_variables_brutally();
  void old_define_polynomial_variables();

  void identify();

  long weight(const Polynomial<F_2>& relation, const AffineHomomorphism<F_2>& phi);

  void sort();
  void test_steenrod();
  void restrict_to_elemab(ifstream& res_file);

  void get_equivalence_class(const list< AffineHomomorphism<F_2> >& homs,
                             const AffineHomomorphism<F_2>& f);

  bool polvars_are_involved_in(const AffineHomomorphism<F_2>& f);

  long extend(AffineHomomorphism<F_2>& f);

  long extend_all();

  bool polynomial_test();

  void compute_all_kernels();
};


#endif

---