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
|
#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 "polyhedralfan.h"
#include "breadthfirstsearch.h"
#include "termorder.h"
#include "ep_standard.h"
#include "ep_xfig.h"
#include "gfanapplication.h"
#include "timer.h"
class StatsApplication : public GFanApplication
{
public:
const char *helpText()
{
return "This program takes a list of reduced Groebner bases for the same ideal and computes various statistics. The following information is listed: the number of bases in the input, the number of variables, the dimension of the homogeneity space, the maximal total degree of any polynomial in the input and the minimal total degree of any basis in the input.\n";
}
StatsApplication()
{
registerOptions();
}
char *name()
{
return "_stats";
}
int main()
{
FileParser p(Stdin);
PolynomialRing theRing=p.parsePolynomialRing();
int c=p.nextNonBlank();
int dmin=-1;
int dmax=-1;
int homog=-1;
int n=-1;
int counter=0;
assert(p.isLeftBracket(c));
do
{
PolynomialSet g=p.parsePolynomialSet(theRing);
if(homog==-1)
{
n=g.numberOfVariablesInRing();
homog=dimensionOfHomogeneitySpace(g);
}
int d=g.totalDegree();
if(dmin==-1 || d<dmin)dmin=d;
if(dmax==-1 || d>dmax)dmax=d;
counter++;
}
while((c=p.nextNonBlank())==',');
assert(p.isRightBracket(c));
fprintf(Stdout,"Number of reduced Groebner bases: %i\n",counter);
fprintf(Stdout,"Number of variables: %i\n",n);
fprintf(Stdout,"Dimension of homogeneity space: %i\n",homog);
fprintf(Stdout,"Maximal total degree of a Groebner basis: %i\n",dmax);
fprintf(Stdout,"Minimal total degree of a Groebner basis: %i\n",dmin);
return 0;
}
};
static StatsApplication theApplication;
|
