-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgroup.h
84 lines (75 loc) · 2.43 KB
/
group.h
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
78
79
80
81
82
83
84
#pragma once
#include <iostream>
#include <vector>
#include <memory>
#include <set>
#include <deque>
class _Group;
class Subgroup;
typedef std::shared_ptr<const _Group> Group;
#include "permutation.h"
#include "coset.h"
#include "fhl.h"
class _Group: public std::enable_shared_from_this<const _Group> {
public:
virtual bool contains( const Permutation& ) const = 0;
virtual int degree() const = 0;
virtual __int128_t order() const = 0;
virtual std::vector<Permutation> generators() const = 0;
virtual Group join( std::deque<Permutation>&& ) const = 0;
virtual bool isGiant() const = 0;
Group share() const;
Permutation one() const;
Group stabilizer( int x ) const;
bool hasSubgroup( Group H ) const;
bool equals( Group H ) const;
std::vector<int> domain() const;
virtual ~_Group() = 0;
std::vector<Coset> allCosets( Group G, bool right = true ) const;
protected:
// static bool _filter( Permutation alpha, std::vector<std::set<Permutation>>& reps, std::function<bool(Permutation)> c );
};
/*class FurstHopcroftLuks {
const _Group* _G;
std::vector<std::set<Permutation>> _reps;
int _n;
mutable int _order;
bool filter( Permutation, bool add = true );
public:
FurstHopcroftLuks() : _G( nullptr ), _order(0) {}
void create( const _Group* group );
void create( const std::deque<Permutation>& L );
bool contains( const Permutation& );
bool isGiant() const;
__int128_t order() const;
std::vector<Permutation> generators() const;
operator bool() const;
};*/
class Subgroup: public _Group {
Group _supergroup;
std::vector<Permutation> _generators;
mutable FHL<Permutation> _fhl;
public:
Group supergroup() const;
virtual bool contains( const Permutation& ) const;
virtual int degree() const;
virtual __int128_t order() const;
virtual std::vector<Permutation> generators() const;
virtual Group join( std::deque<Permutation>&& ) const;
virtual bool isGiant() const;
Subgroup( Group, std::vector<Permutation> );
Subgroup( Group, std::function<bool(Permutation)> );
virtual ~Subgroup();
};
class SymmetricGroup: public _Group {
int _degree;
public:
virtual bool contains( const Permutation& ) const;
virtual int degree() const;
virtual __int128_t order() const;
virtual std::vector<Permutation> generators() const;
virtual Group join( std::deque<Permutation>&& ) const;
virtual bool isGiant() const;
SymmetricGroup( int n );
virtual ~SymmetricGroup();
};