File: RandomAutoInFree.h

package info (click to toggle)
magnus 20060324-3
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 19,404 kB
  • ctags: 20,466
  • sloc: cpp: 130,118; ansic: 37,076; tcl: 10,970; perl: 1,109; makefile: 963; sh: 403; yacc: 372; csh: 57; awk: 33; asm: 10
file content (77 lines) | stat: -rw-r--r-- 2,616 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
// Copyright (C) 1996 The New York Group Theory Cooperative
// See magnus/doc/COPYRIGHT for the full notice.
//
// Contents: Declarations of class RandomAutoInFree
//
// Principal Author:Alexey Myasnikov
//
// Status: in progress
//
// Revision History:
//

#ifndef _RANDOMAUTOINFREE_H_
#define _RANDOMAUTOINFREE_H_


#include "RandomNumbers.h"
#include "FreeGroup.h"
#include "Map.h"


//---------------------------------------------------------------------------//
//--------------------------- RandomAutoInFree ------------------------------//
//---------------------------------------------------------------------------//


class RandomAutoInFree
{
public:

  /////////////////////////////////////////////////////////////////////////
  //                                                                     //
  // Constructors:                                                       //
  //                                                                     //
  /////////////////////////////////////////////////////////////////////////

  RandomAutoInFree(const FreeGroup& F, int avgNumGens);


  /////////////////////////////////////////////////////////////////////////
  //                                                                     //
  // Accessors:                                                          //
  //                                                                     //
  /////////////////////////////////////////////////////////////////////////
  Map getAutomorphism();
  // Returns random automorhism.
  Map getFiniteAutomorphism(int& order);
  // Returns random automorhism of finite order. "order" is equal to
  // order of automorpism.
  Trichotomy isFiniteAutomorphism(const Map& m,int& order)const;
  // Returns true if automorhism of finite order, no if not and dontknow, if
  // it can't solve this problem. "order" is equal to order of automorpism if it finite.

 
private:

  bool isTooLong(const VectorOf<Word>& images )const;
  int sumOfImagesLens(const VectorOf<Word>& images)const;
  /////////////////////////////////////////////////////////////////////////
  //                                                                     //
  // Data Members:                                                       //
  //                                                                     //
  /////////////////////////////////////////////////////////////////////////

  static const short MAXLENGTH = 32767; //??????????????????
  FreeGroup theGroup;

  int numberOfGroupGens;

  NormalRandom numGensPicker;
  UniformRandom typeGenPicker;

  int avgNumGens;

};

#endif