/usr/include/polybori/groebner/groebner_alg.h is in libpolybori-groebner-dev 0.8.3-3+b2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*
* groebner_alg.h
* PolyBoRi
*
* Created by Michael Brickenstein on 20.04.06.
* Copyright 2006 The PolyBoRi Team. See LICENSE file.
*
*/
#ifndef PBORI_GB_ALG_H
#define PBORI_GB_ALG_H
#include "PairStatusSet.h"
#include "PairManager.h"
#include "MonomialHasher.h"
#include "ReductionStrategy.h"
#include "GroebnerStrategy.h"
#include "LessWeightedLengthInStrat.h"
#include "LargerDegreeComparer.h"
#include "LessWeightedLengthInStratModified.h"
#include "LessEcartThenLessWeightedLengthInStrat.h"
#include "LessUsedTailVariablesThenLessWeightedLengthInStrat.h"
#include "LessCombinedManySizesInStrat.h"
#include <polybori.h>
#include "groebner_defs.h"
#include "pairs.h"
#include <boost/dynamic_bitset.hpp>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <iostream>
#include "cache_manager.h"
#include "polynomial_properties.h"
BEGIN_NAMESPACE_PBORIGB
#define LL_RED_FOR_GROEBNER 1
Polynomial map_every_x_to_x_plus_one(Polynomial p);
MonomialSet mod_var_set(const MonomialSet& as, const MonomialSet& vs);
void groebner(GroebnerStrategy& strat);
Polynomial reduce_by_binom(const Polynomial& p, const Polynomial& binom);
Polynomial reduce_by_monom(const Polynomial& p, const Monomial& m);
Polynomial reduce_complete(const Polynomial& p, const Polynomial& reductor);
Polynomial mult_fast_sim(const std::vector<Polynomial>& vec,
const BoolePolyRing& ring);
std::vector<Polynomial> full_implication_gb(const Polynomial & p,CacheManager& cache,GroebnerStrategy& strat);
Polynomial reduce_complete(const Polynomial &p, const PolyEntry& reductor, wlen_type &len);
MonomialSet recursively_insert(MonomialSet::navigator p, idx_type idx, MonomialSet mset);
inline Polynomial
cancel_monomial_in_tail(const Polynomial& p, const Monomial & m){
Monomial lm=p.lead();
Polynomial res=reduce_by_monom(p,m);
if ((!res.isZero()) && (res.lead()==lm)){
return res;
} else {
return res+lm;
}
/*Polynomial tail=p-lm;
Monomial used_var=tail.usedVariables();
if (used_var.reducibleBy(m)){
tail=Polynomial(BooleSet(tail).diff(m.multiples(used_var)));
}
return tail+lm;*/
}
inline Polynomial
reduce_by_binom(const Polynomial& p, const Polynomial& binom){
PBORI_ASSERT(binom.length()==2);
Monomial bin_lead=binom.lead();
Monomial bin_last=*(++(binom.orderedBegin()));
MonomialSet dividing_terms=((MonomialSet)p).multiplesOf(bin_lead);
Monomial b_p_gcd=bin_last.GCD(bin_lead);
Monomial divide_by=bin_lead/b_p_gcd;
Monomial multiply_by=bin_last/b_p_gcd;
Polynomial rewritten=((Polynomial) dividing_terms)/divide_by;
return p-dividing_terms+rewritten*multiply_by;
}
inline Polynomial
reduce_by_binom_in_tail (const Polynomial& p, const Polynomial& binom){
PBORI_ASSERT(binom.length()==2);
Monomial lm=p.lead();
return lm+reduce_by_binom(p-lm,binom);
}
END_NAMESPACE_PBORIGB
#endif
|