File: app_spolynomial.cpp

package info (click to toggle)
gfan 0.5%2Bdfsg-6
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 8,348 kB
  • ctags: 5,683
  • sloc: cpp: 39,675; makefile: 454; sh: 1
file content (93 lines) | stat: -rw-r--r-- 2,226 bytes parent folder | download | duplicates (6)
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
#include <iostream>
#include "parser.h"
#include "printer.h"
#include "polynomial.h"
#include "buchberger.h"
#include "reversesearch.h"
#include "termorder.h"
#include "genericwalk.h"
#include "gfanapplication.h"
#include "timer.h"
#include "tropical2.h"
#include "log.h"
#include "field_rationals.h"

class SPolynomialApplication : public GFanApplication
{
  SimpleOption optionTakeInitialForms;
public:
  bool includeInDefaultInstallation()
  {
    return false;
  }
  const char *helpText()
  {
    return "This program takes a list of polynomials and a weight vector. The output is the set of all...\n";
  }
  SPolynomialApplication():
    optionTakeInitialForms("-f",".\n")
  {
    registerOptions();
  }

  const char *name()
  {
    return "_spolynomial";
  }

  int main()
  {
    PolynomialSet g=FileParser(Stdin).parsePolynomialSetWithRing();
    IntegerVector w=FileParser(Stdin).parseIntegerVector();

    //    WeightReverseLexicographicTermOrder T(w);
    WeightTermOrder T(w);

    g.markAndScale(T);
    PolynomialSet out(g.getRing());

    int I=0;
    for(PolynomialSet::const_iterator i=g.begin();i!=g.end();i++,I++)
      {
	int J=0;
	for(PolynomialSet::const_iterator j=g.begin();j!=i;j++,J++)
	{
	  Polynomial s=sPolynomial(*i,*j);
	  IntegerVector cancelingTerm=max(i->getMarked().m.exponent,j->getMarked().m.exponent);
	  int cancelDegree=dotLong(cancelingTerm,w);
	  if(optionTakeInitialForms.getValue())
	    {
	      if(cancelDegree!=s.degree(w))
		{
		  out.push_back(initialForm(s,w));
		  if(initialForm(s,w).numberOfTerms()<=8)cerr<<"S("<<I<<","<<J<<")"<<endl;
		}
	    }
	  else
	    out.push_back(s);
	}
      }
    //    AsciiPrinter(Stdout).printPolynomialSet(out);

    PolynomialSet out2(out.getRing());
    for(PolynomialSet::const_iterator i=out.begin();i!=out.end();i++)
      {
	cerr<< i->numberOfTerms() << "    ";
	if(i->numberOfTerms()<=8)
	  {
	    AsciiPrinter(Stdout)<<"\n"<< *i<<"\n";
	    out2.push_back(*i);
	  }
      }
    out2.saturate();
    out2=out2.embeddedInto(PolynomialRing(Q,15));

    AsciiPrinter(Stdout).printPolynomialRing(out2.getRing());
    AsciiPrinter(Stdout).printPolynomialSet(out2);

    return 0;
  }
};

static SPolynomialApplication theApplication;