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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
#include "parser.h"
#include "printer.h"
#include "polynomial.h"
#include "division.h"
#include "buchberger.h"
#include "wallideal.h"
#include "lp.h"
#include "reversesearch.h"
#include "termorder.h"
#include "ep_standard.h"
#include "ep_xfig.h"
#include "gfanapplication.h"
#include "wallideal.h"
class EdwinsConjectureApplication : public GFanApplication
{
SimpleOption optionReadWeightVector;
public:
bool includeInDefaultInstallation()
{
return false;
}
const char *helpText()
{
return "Program to help us test Edwin's conjecture\n";
}
EdwinsConjectureApplication():
optionReadWeightVector("-w","undocumented")
{
registerOptions();
}
char *name()
{
return "_edwinsconjecture";
}
bool inList(IntegerVector const &v,IntegerVectorList const &l)
{
for(IntegerVectorList::const_iterator i=l.begin();i!=l.end();i++)
if(*i==v)return true;
return false;
}
IntegerVector MatrixMultiplication(IntegerVectorList const &a, IntegerVector const &b)
{
IntegerVector sum(a.begin()->size());
int j=0;
for(IntegerVectorList::const_iterator i=a.begin();i!=a.end();i++)
{
sum+=(b[j])*(*i);
j++;
}
return sum;
}
int main()
{
TermOrder *myOrder;
IntegerVectorList A=FileParser(Stdin).parseIntegerVectorList();
PolynomialSet g=FileParser(Stdin).parsePolynomialSetWithRing();
IntegerVectorList gL=wallInequalities(g);
IntegerVectorList circuits=FileParser(Stdin).parseIntegerVectorList();
fprintf(Stderr,"Input matrix:\n");
AsciiPrinter(Stderr).printVectorList(A);
fprintf(Stderr,"A Groebner basis:\n");
AsciiPrinter(Stderr).printPolynomialSet(g);
fprintf(Stderr,"As vectors:\n");
AsciiPrinter(Stderr).printVectorList(gL);
fprintf(Stderr,"The circuits:\n");
AsciiPrinter(Stderr).printVectorList(circuits);
IntegerVectorList additional;
for(IntegerVectorList::const_iterator i=gL.begin();i!=gL.end();i++)
{
if((!inList(*i,circuits))&&(!inList(-(*i),circuits)))
{
// AsciiPrinter(Stdout).printVector(*i);
IntegerVector degree=MatrixMultiplication(A,max(*i,*i-*i));
// AsciiPrinter(Stdout).printVector(degree);
additional.push_back(degree);
}
}
for(IntegerVectorList::const_iterator i=additional.begin();i!=additional.end();i++)
A.push_back(*i);
fprintf(Stderr,"New matrix:\n");
AsciiPrinter(Stderr).printVectorList(A);
AsciiPrinter(Stdout).printVectorList(A);
return 0;
}
};
static EdwinsConjectureApplication theApplication;
|
