PolyBoRi
groebner_alg.h
Go to the documentation of this file.
1 /*
2  * groebner_alg.h
3  * PolyBoRi
4  *
5  * Created by Michael Brickenstein on 20.04.06.
6  * Copyright 2006 The PolyBoRi Team. See LICENSE file.
7  *
8  */
9 
10 #ifndef PBORI_GB_ALG_H
11 #define PBORI_GB_ALG_H
12 
13 
14 #include "PairStatusSet.h"
15 #include "PairManager.h"
16 #include "MonomialHasher.h"
17 #include "ReductionStrategy.h"
18 #include "GroebnerStrategy.h"
20 #include "LargerDegreeComparer.h"
25 
26 #include <polybori.h>
27 #include "groebner_defs.h"
28 #include "pairs.h"
29 #include <boost/dynamic_bitset.hpp>
30 #include <vector>
31 #include <string>
32 #include <algorithm>
33 #include <utility>
34 #include <iostream>
35 #include "cache_manager.h"
36 #include "polynomial_properties.h"
37 
38 
40 
41 #define LL_RED_FOR_GROEBNER 1
43 
44 MonomialSet mod_var_set(const MonomialSet& as, const MonomialSet& vs);
45 void groebner(GroebnerStrategy& strat);
46 Polynomial reduce_by_binom(const Polynomial& p, const Polynomial& binom);
47 Polynomial reduce_by_monom(const Polynomial& p, const Monomial& m);
48 Polynomial reduce_complete(const Polynomial& p, const Polynomial& reductor);
49 
50 
51 
52 
53 
54 Polynomial mult_fast_sim(const std::vector<Polynomial>& vec,
55  const BoolePolyRing& ring);
56 std::vector<Polynomial> full_implication_gb(const Polynomial & p,CacheManager& cache,GroebnerStrategy& strat);
57 Polynomial reduce_complete(const Polynomial &p, const PolyEntry& reductor, wlen_type &len);
58 MonomialSet recursively_insert(MonomialSet::navigator p, idx_type idx, MonomialSet mset);
59 
60 
61 
62 
63 inline Polynomial
65  Monomial lm=p.lead();
66 
67  Polynomial res=reduce_by_monom(p,m);
68  if ((!res.isZero()) && (res.lead()==lm)){
69  return res;
70  } else {
71  return res+lm;
72  }
73  /*Polynomial tail=p-lm;
74  Monomial used_var=tail.usedVariables();
75 
76  if (used_var.reducibleBy(m)){
77  tail=Polynomial(BooleSet(tail).diff(m.multiples(used_var)));
78 
79  }
80  return tail+lm;*/
81 }
82 
83 inline Polynomial
84 reduce_by_binom(const Polynomial& p, const Polynomial& binom){
85  PBORI_ASSERT(binom.length()==2);
86 
87  Monomial bin_lead=binom.lead();
88  Monomial bin_last=*(++(binom.orderedBegin()));
89 
90  MonomialSet dividing_terms=((MonomialSet)p).multiplesOf(bin_lead);
91 
92  Monomial b_p_gcd=bin_last.GCD(bin_lead);
93 
94  Monomial divide_by=bin_lead/b_p_gcd;
95  Monomial multiply_by=bin_last/b_p_gcd;
96 
97  Polynomial rewritten=((Polynomial) dividing_terms)/divide_by;
98  return p-dividing_terms+rewritten*multiply_by;
99 
100 }
101 
102 
103 inline Polynomial
105  PBORI_ASSERT(binom.length()==2);
106  Monomial lm=p.lead();
107  return lm+reduce_by_binom(p-lm,binom);
108 }
109 
110 
112 
113 #endif
114 
Polynomial cancel_monomial_in_tail(const Polynomial &p, const Monomial &m)
Definition: groebner_alg.h:64
Polynomial reduce_complete(const Polynomial &p, const PolyEntry &reductor, wlen_type &len)
Definition: groebner_alg.cc:234
monom_type lead() const
Get leading term.
Definition: BoolePolynomial.cc:225
self GCD(const self &) const
Compute the greatest common divisor.
Definition: BooleMonomial.cc:169
#define END_NAMESPACE_PBORIGB
Definition: groebner_defs.h:16
self multiplesOf(const term_type &rhs) const
Compute intersection with multiples of rhs.
Definition: BooleSet.cc:171
MonomialSet mod_var_set(const MonomialSet &as, const MonomialSet &vs)
Definition: groebner_alg.cc:85
BoolePolynomial Polynomial
Definition: embed.h:51
#define BEGIN_NAMESPACE_PBORIGB
Definition: groebner_defs.h:15
This class wraps the underlying decicion diagram type and defines the necessary operations.
Definition: BoolePolynomial.h:85
Polynomial reduce_by_binom(const Polynomial &p, const Polynomial &binom)
Definition: groebner_alg.h:84
polybori::BooleSet MonomialSet
Definition: groebner_defs.h:45
void groebner(GroebnerStrategy &strat)
Polynomial map_every_x_to_x_plus_one(Polynomial p)
Definition: groebner_alg.cc:405
MonomialSet recursively_insert(MonomialSet::navigator p, idx_type idx, MonomialSet mset)
Definition: groebner_alg.cc:368
#define PBORI_ASSERT(arg)
Definition: pbori_defs.h:118
Polynomial reduce_by_monom(const Polynomial &p, const Monomial &m)
assumes that divisibility condition is fullfilled
Definition: groebner_alg.cc:147
long wlen_type
Definition: groebner_defs.h:39
Polynomial reduce_by_binom_in_tail(const Polynomial &p, const Polynomial &binom)
Definition: groebner_alg.h:104
Polynomial mult_fast_sim(const std::vector< Polynomial > &vec, const BoolePolyRing &ring)
Definition: groebner_alg.cc:417
size_type length() const
Returns number of terms.
Definition: BoolePolynomial.cc:414
bool_type isZero() const
Check whether polynomial is constant zero.
Definition: BoolePolynomial.h:294
polybori::CTypes::idx_type idx_type
Definition: groebner_defs.h:44
Definition: BooleSet.h:57
This class is just a wrapper for using variables from cudd's decicion diagram.
Definition: BooleMonomial.h:50
BooleMonomial Monomial
Definition: embed.h:53
std::vector< Polynomial > full_implication_gb(const Polynomial &p, CacheManager &cache, GroebnerStrategy &strat)
Definition: groebner_alg.cc:458
ordered_iterator orderedBegin() const
Start of ordering respecting iterator.
Definition: BoolePolynomial.cc:491