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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
#include "vektor.h"
#include "printer.h"
#include "parser.h"
#include "gfanapplication.h"
#include "minkowskisum.h"
#include "newtonpolytope.h"
#include "buchberger.h"
#include "wallideal.h"
#include "lp.h"
#include "tropical.h"
#include "division.h"
#include "bergman.h"
#include "tropical2.h"
#include "dimension.h"
#include "timer.h"
class TropicalApplication : public GFanApplication
{
FieldOption theFieldOption;
SimpleOption optionMultipleSets;
SimpleOption optionRay;
SimpleOption optionTraverse;
SimpleOption optionPerformanceTimer;
SimpleOption optionSymmetry;
SimpleOption optionGuess;
SimpleOption optionIncidencePrinting;
SimpleOption optionInitialIdealPrinting;
public:
bool includeInDefaultInstallation()
{
return false;
}
const char *helpText()
{
return "topical.\n";
}
TropicalApplication():
optionPerformanceTimer("-T","Enable performance timer"),
optionMultipleSets("-m","undocumented"),
optionRay("--ray","undocumented"),
optionGuess("--guess","undocumented"),
optionTraverse("--traverse","undocumented"),
optionSymmetry("--symmetry","undocumented"),
optionIncidencePrinting("--incidence","Print incidence information. This will also extract the full fan from its orbits!"),
optionInitialIdealPrinting("--initialideals","Print the initial ideals during incidence printing ONLY with --incidence")
{
registerOptions();
}
char *name()
{
return "_tropical";
}
int main()
{
PolynomialSetList tropical;
lpSetSolver("cddgmp");
FileParser P(Stdin);
if(optionGuess.getValue())
{
PolynomialSet g=P.parsePolynomialSetWithRing();
buchberger(&g,StandardGradedLexicographicTermOrder());
PolynomialSet fullBasis(g.getRing());
PolynomialSet g2=guessInitialIdealWithoutMonomial(g,&fullBasis,false);
AsciiPrinter(Stdout).printPolynomialSet(g2);
AsciiPrinter(Stdout).printPolynomialSet(fullBasis);
fprintf(Stderr,"Input: Krull dimension %i Dimension of homogeneity space %i\n",krullDimension(g),dimensionOfHomogeneitySpace(g));
fprintf(Stderr,"Output: Krull dimension %i Dimension of homogeneity space %i\n",krullDimension(g2),dimensionOfHomogeneitySpace(g2));
return 0;
}
if(optionRay.getValue())
{
AsciiPrinter p(Stdout);
bergmanRay(P.parsePolynomialSetWithRing()).print(p);
return 0;
}
if(optionTraverse.getValue())
{
AsciiPrinter p(Stdout);
PolynomialSet coneGroebnerBasis=P.parsePolynomialSetWithRing();
PolynomialSet idealGroebnerBasis=P.parsePolynomialSet(coneGroebnerBasis.getRing());
coneGroebnerBasis.changeNumberOfVariables(idealGroebnerBasis.numberOfVariablesInRing());
SymmetryGroup s(idealGroebnerBasis.numberOfVariablesInRing());
if(optionSymmetry.getValue())
{
IntegerVectorList generators=P.parseIntegerVectorList();
for(IntegerVectorList::iterator i=generators.begin();i!=generators.end();i++)
{
assert(areIdealsEqual(idealGroebnerBasis,SymmetryGroup::permutePolynomialSet(idealGroebnerBasis,*i)));
}
s.computeClosure(generators);
s.print(Stderr);
}
BergmanFan f=bergman(coneGroebnerBasis,idealGroebnerBasis,&s);
f.print(p);
if(optionIncidencePrinting.getValue())
{
PolyhedralFan p1=f.toPolyhedralFan();
p1.removeAllLowerDimensional();
AsciiPrinter Q(Stdout);
assert(0);// p1.printWithIndices(&Q,&s);
}
if(optionInitialIdealPrinting.getValue())
{
// AsciiPrinter p(Stderr);
PolyhedralFan p1=f.toPolyhedralFan();
int n=p1.getAmbientDimension();
IncidenceList a=p1.getIncidenceList(&s);
IntegerVectorList rays=p1.getRaysInPrintingOrder(&s);
p.printString("Rays:\n");
p.printVectorList(rays);
vector<IntegerVector> rays2(rays.size());
int K=0;
for(IntegerVectorList::const_iterator k=rays.begin();k!=rays.end();k++)
rays2[K++]=*k;
for(IncidenceList::const_iterator j=a.begin();j!=a.end();j++)
{
p.printInteger(j->first);
for(IntegerVectorList::const_iterator i=j->second.begin();i!=j->second.end();i++)
{
p.printVector(*i);
IntegerVector v(n);
for(int t=0;t<i->size();t++)
{
v+=rays2[(*i)[t]];
}
p.printVector(v);
PolynomialSet g2=idealGroebnerBasis;
buchberger(&g2,WeightReverseLexicographicTermOrder(v));
g2=initialFormsAssumeMarked(g2,v);
g2=saturatedIdeal(g2);
p.printPolynomialSet(g2);
}
}
}
if(optionPerformanceTimer.getValue())Timer::printList();
return 0;
}
PolynomialSetList input;
if(optionMultipleSets.getValue())
input=P.parsePolynomialSetListWithRing();
else
input.push_back(P.parsePolynomialSetWithRing());
for(PolynomialSetList::const_iterator g=input.begin();g!=input.end();g++)
{
PolynomialSetList s=fullColoredIdeals(*g,false);
static int num;
fprintf(Stderr,"Monomial Intial Ideal num: %i\n",num++);
// AsciiPrinter(Stdout).printPolynomialSetList(s);
// fprintf(Stdout,"contains no monomials:\n");
for(PolynomialSetList::const_iterator i=s.begin();i!=s.end();i++)
{
fprintf(Stderr,"Testing ideal:\n");
AsciiPrinter(Stderr).printPolynomialSet(*i);
if(!containsMonomial(*i))
{
// AsciiPrinter(Stdout).printPolynomialSet(*i);
PolynomialSet g=*i;
buchberger(&g,StandardGradedLexicographicTermOrder());
bool inList=false;
for(PolynomialSetList::const_iterator j=tropical.begin();j!=tropical.end();j++)
{
if(areIdealsEqual(*j,g))
{
inList=true;
break;
}
}
if(!inList)tropical.push_back(g);
}
}
}
fprintf(Stderr,"No duplicates:\n");
AsciiPrinter(Stdout).printPolynomialSetList(tropical);
for(PolynomialSetList::const_iterator i=tropical.begin();i!=tropical.end();i++)
{
int coDim=rankOfMatrix(wallInequalities(*i));
int d=i->numberOfVariablesInRing()-coDim;
if(d<0)
{
fprintf(Stderr,"Error computing dimension of cone:");
AsciiPrinter(Stderr).printPolynomialSet(*i);
AsciiPrinter(Stderr).printVectorList(wallInequalities(*i));
fprintf(Stderr,"coDim= %i, numberOfVariables= %i\n",coDim,i->numberOfVariablesInRing());
}
fprintf(Stderr,"%i\n",d);
}
return 0;
}
};
static TropicalApplication theApplication;
|
