allemang.d/toddcox-visualize
1
0
Fork 0
mirror of https://github.com/allemangD/toddcox-visualize.git synced 2025-11-10 12:02:47 -05:00
Code Issues Packages Projects Releases Wiki Activity

restructure cmake project

Browse Source
This commit is contained in:
David Allemang
2019-12-27 16:59:06 -05:00
parent 08aa3f5453
commit c489d530a9
7 changed files with 7 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

132
src/groups.cpp Normal file
View File

@@ -0,0 +1,132 @@
#include "groups.h"
namespace tc {
Group::Group(int ngens, const std::vector<Mult> &rels) : ngens(ngens) {
_mults.resize(ngens);
for (int i = 0; i < ngens; i++) {
_mults[i].resize(ngens, 2);
}
for (Mult m : rels) {
if (m.gen0 < m.gen1)
_mults[m.gen0][m.gen1] = m.mult;
else
_mults[m.gen1][m.gen0] = m.mult;
}
}
void Group::setmult(Mult m) {
if (m.gen0 < m.gen1)
_mults[m.gen0][m.gen1] = m.mult;
else
_mults[m.gen1][m.gen0] = m.mult;
}
std::vector<Mult> Group::get_mults() const {
std::vector<Mult> mults;
for (int i = 0; i < ngens - 1; i++) {
for (int j = i + 1; j < ngens; j++) {
mults.push_back({i, j, _mults[i][j]});
}
}
return mults;
}
Group Group::product(const Group &other) const {
int off = ngens;
Group g(ngens + other.ngens, get_mults());
for (Mult m : other.get_mults()) {
g.setmult({off + m.gen0, off + m.gen1, m.mult});
}
return g;
}
Group Group::power(int p) const {
Group g(ngens * p);
for (Mult m : get_mults()) {
for (int off = 0; off < g.ngens; off += ngens) {
g.setmult({off + m.gen0, off + m.gen1, m.mult});
}
}
return g;
}
Group operator*(const Group &g, const Group &h) {
return g.product(h);
}
Group operator^(const Group &g, const int &p) {
return g.power(p);
}
Group schlafli(const std::vector<int> &mults) {
int ngens = mults.size() + 1;
Group g(ngens);
for (int i = 0; i < mults.size(); i++) {
g.setmult({i, i + 1, mults[i]});
}
return g;
}
namespace group {
Group A(const int n) {
if (n == 0)
return Group(0);
return schlafli(std::vector<int>(n - 1, 3));
}
Group B(const int n) {
std::vector<int> mults(n - 1, 3);
mults[0] = 4;
return schlafli(mults);
}
Group D(const int n) {
std::vector<int> mults(n - 1, 3);
mults[n - 2] = 2;
Group g = schlafli(mults);
g.setmult({1, n - 1, 3});
return g;
}
Group E(const int n) {
std::vector<int> mults(n - 1, 3);
mults[n - 2] = 2;
Group g = schlafli(mults);
g.setmult({2, n - 1, 3});
return g;
}
Group F4() {
return schlafli({3, 4, 3});
}
Group G2() {
return schlafli({6});
}
Group H(const int n) {
std::vector<int> mults(n - 1, 3);
mults[0] = 5;
return schlafli(mults);
}
Group I2(const int n) {
return schlafli({n});
}
Group T(const int n, const int m) {
return I2(n) * I2(m);
}
Group T(const int n) {
return I2(n) ^ 2;
}
}
}

154
src/solver.cpp Normal file
View File

@@ -0,0 +1,154 @@
#include "solver.h"
#include <algorithm>
#include <functional>
namespace tc {
Cosets::Cosets(int ngens, const std::vector<int> &data) : ngens(ngens), data(data) {
len = data.size() / ngens;
}
void Cosets::add_row() {
len++;
data.resize(data.size() + ngens, -1);
}
void Cosets::put(int coset, int gen, int target) {
data[coset * ngens + gen] = target;
data[target * ngens + gen] = coset;
}
void Cosets::put(int idx, int target) {
int coset = idx / ngens;
int gen = idx % ngens;
data[idx] = target;
data[target * ngens + gen] = coset;
}
int Cosets::get(int coset, int gen) const {
return data[coset * ngens + gen];
}
int Cosets::get(int idx) const {
return data[idx];
}
RelTable::RelTable(Mult m) : mult(m.mult) {
gens[0] = m.gen0;
gens[1] = m.gen1;
}
int RelTable::add_row() {
int idx = lst_ptr.size();
lst_ptr.push_back(nullptr);
gen.push_back(-1);
return idx;
}
Cosets solve(const Group &group, const std::vector<int> &sub_gens) {
std::vector<int> init_row(group.ngens, -1);
for (int i : sub_gens) {
init_row[i] = 0;
}
Cosets cosets(group.ngens, init_row);
std::vector<RelTable> rel_tables;
std::vector<std::vector<int>> gen_map(group.ngens);
int rel_idx;
for (Mult m : group.get_mults()) {
rel_idx = rel_tables.size();
gen_map[m.gen0].push_back(rel_idx);
gen_map[m.gen1].push_back(rel_idx);
rel_tables.emplace_back(m);
}
int null_lst_ptr;
for (RelTable &rel : rel_tables) {
int idx = rel.add_row();
if (cosets.get(rel.gens[0]) + cosets.get(rel.gens[1]) == -2) {
rel.lst_ptr[idx] = new int;
rel.gen[idx] = 0;
} else {
rel.lst_ptr[idx] = &null_lst_ptr;
rel.gen[idx] = -1;
}
}
int idx = 0;
int coset, gen, target, fact_idx, lst, gen_;
while (true) {
while (idx < cosets.data.size() and cosets.get(idx) >= 0)
idx++;
if (idx == cosets.data.size())
break;
target = cosets.len;
cosets.add_row();
for (RelTable &rel : rel_tables) {
rel.add_row();
}
std::vector<int> facts;
facts.push_back(idx);
coset = idx / group.ngens;
gen = idx % group.ngens;
while (!facts.empty()) {
fact_idx = facts.back();
facts.pop_back();
if (cosets.get(fact_idx) != -1)
continue;
cosets.put(fact_idx, target);
coset = fact_idx / group.ngens;
gen = fact_idx % group.ngens;
for (int rel_idx : gen_map[gen]) {
RelTable &rel = rel_tables[rel_idx];
if (rel.lst_ptr[target] == nullptr) {
rel.lst_ptr[target] = rel.lst_ptr[coset];
rel.gen[target] = rel.gen[coset] + 1;
if (rel.gen[coset] < 0)
rel.gen[target] -= 2;
if (rel.gen[target] == rel.mult) {
lst = *(rel.lst_ptr[target]);
delete rel.lst_ptr[target];
gen_ = rel.gens[(int) (rel.gens[0] == gen)];
facts.push_back(lst * group.ngens + gen_);
} else if (rel.gen[target] == -rel.mult) {
gen_ = rel.gens[rel.gens[0] == gen];
facts.push_back(target * group.ngens + gen_);
} else if (rel.gen[target] == rel.mult - 1) {
*(rel.lst_ptr[target]) = target;
}
}
}
std::sort(facts.begin(), facts.end(), std::greater<>());
}
for (RelTable &rel : rel_tables) {
if (rel.lst_ptr[target] == nullptr) {
if ((cosets.get(target, rel.gens[0]) != target) and
(cosets.get(target, rel.gens[1]) != target)) {
rel.lst_ptr[target] = new int;
rel.gen[target] = 0;
} else {
rel.lst_ptr[target] = &null_lst_ptr;
rel.gen[target] = -1;
}
}
}
}
return cosets;
}
}