#6177: [with patch, needs work] Update PolyBoRi to newest upstream release
-------------------------+--------------------------------------------------
Reporter: malb | Owner: malb
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.0.2
Component: packages | Keywords: M4RI, PolyBoRi
-------------------------+--------------------------------------------------
Comment(by malb):
Michael's notes on the docs:
{{{
all_spolys_in_next_degree()
pops all spolys with next sugar degree from the strategy
clean_top_by_chain_criterion()
contains_one()
1 \in generating system?
faugere_step_dense()
reduces a vector of polynomials using linear algebra
implications()
computes useful implied polynomials of i-th generator, and adds them to
the strategy, if it finds any.
ll_reduce_all()
uses the build in ll-encoded BooleSet of polynomials with linear
lexicographical leading term, which coincides
with leading term in current ordering, to reduce the tails of all
polynomials in the strategy
minimalize()
returns a vector of all polynomials with minimal leading terms use that if
strat contains a GB
minimalize_and_tail_reduce()
returns a vector of all polynomials with minimal leading terms and does
tail reductions use that if strat contains a GB and you want a reduced GB
next_spoly()
nf()
npairs()
Number of pairs in the pair queue
reduction_strategy
ReductionStrategy member of GroebnerStrategy, does all the reductions
small_spolys_in_next_degree()
I am not sure, if it is still used, similar to the next one
some_spolys_in_next_degree(n)
fetches upto n s-polynomials from the strategy, having all a sugar
value <= the sugar value of the first polynomial/pair in the queue.
suggest_plugin_variable()
some heuristic to suggest a variable, which could be plugged with 0 and 1
to branch the computation
symmGB_F2()
out of date C++ implementation of symmgb, will revived at some point of
time
top_sugar()
sugar value of the first "pair" in the queue. Sugar is "some estimated
degree".
variable_has_value()
Computes, whether, there exists some polynomial of the form $v+c$ in the
Strategy, where c is a constant
in the list of generators
elength()
x+y*z -> 3
for lp (x>y>z)
the interesting case
Note
If this function is called repeatedly with the same I then it is
advised to use PolyBoRi’s GroebnerStrategy object directly, since that
will be faster. See the source code of this function for details.
-> ReductionStrategy, as it is smaller and contains everything needed
for reductions.
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6177#comment:4>
Sage <http://sagemath.org/>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
