Groebner
Walk
convert Groebner bases from one ordering to another
Calling Sequence
Parameters
Description
Examples
References
Walk(G, T1, T2, opts)
G
-
Groebner basis with respect to starting order T1 or a PolynomialIdeal
T1,T2
monomial orders (of type ShortMonomialOrder)
opts
optional arguments of the form keyword=value
The Groebner walk algorithm converts a Groebner basis of commutative polynomials from one monomial order to another. It is frequently applied when a Groebner basis is too difficult to compute directly.
The Walk command takes as input a Groebner basis G with respect to a monomial order T1, and outputs the reduced Groebner basis for G with respect to T2. If the first argument G is a PolynomialIdeal then a Groebner basis for G with respect to T1 is computed if one is not already known.
The orders T1 and T2 must be proper monomial orders on the polynomial ring, so 'min' orders such as 'plex_min' and 'tdeg_min' are not supported. Walk does not check that G is a Groebner basis with respect to T1.
Unlike FGLM, the ideal defined by G can have an infinite number of solutions. The Groebner walk is typically not as fast as FGLM on zero-dimensional ideals.
The optional argument characteristic=p specifies the characteristic of the coefficient field. The default is zero. This option is ignored if G is a PolynomialIdeal.
The optional argument elimination=true forces the Groebner walk to terminate early, before a Groebner basis with respect to T2 is obtained. If T2 is a lexdeg order with two blocks of variables the resulting list will contain a generating set of the elimination ideal.
The optional argument output=basislm returns the basis in an extended format containing leading monomials and coefficients. Each element is a list of the form [leading coefficient, leading monomial, polynomial].
Setting infolevel[Walk] to a positive integer value directs the Walk command to output increasingly detailed information about its performance and progress.
with⁡Groebner:
F1≔10⁢x⁢z−6⁢x3−8⁢y2⁢z2,−6⁢z+5⁢y3
F1≔−8⁢y2⁢z2−6⁢x3+10⁢x⁢z,5⁢y3−6⁢z
G1≔Basis⁡F1,tdeg⁡x,y,z
G1≔5⁢y3−6⁢z,4⁢y2⁢z2+3⁢x3−5⁢x⁢z,15⁢x3⁢y−25⁢x⁢y⁢z+24⁢z3,45⁢x6−96⁢y⁢z5−150⁢x4⁢z+125⁢x2⁢z2
Walk⁡G1,tdeg⁡x,y,z,plex⁡x,y,z
5⁢y3−6⁢z,4⁢y2⁢z2+3⁢x3−5⁢x⁢z
alias⁡α=RootOf⁡z2+z+5
α
F2≔−10⁢y⁢x−9⁢x3+2⁢z⁢α2−4⁢y3⁢α,6⁢α2−2⁢x2⁢α+9⁢x⁢α2−8⁢y3⁢x:
G2≔Basis⁡F2,tdeg⁡x,y,z
G2≔10⁢y⁢x+4⁢y3⁢α+9⁢x3+2⁢α+10⁢z,6⁢α+30+2⁢x2⁢α+8⁢y3⁢x+9⁢α+45⁢x,−24⁢α+30−16⁢α⁢y3⁢z+32⁢y6+56⁢α+10⁢x2+36⁢α+180⁢y3+4⁢α+20⁢x⁢z+−72⁢α+90⁢z+−36⁢α+45⁢x+60⁢α⁢y
Walk⁡G2,tdeg⁡x,y,z,plex⁡x,y,z
9216⁢y12−4608⁢α⁢y9⁢z+31104⁢α⁢y9+155520⁢y9+16640⁢α⁢y7−62208⁢α⁢y6⁢z+293616⁢α⁢y6−3200⁢y7+77760⁢y6⁢z+1280⁢α⁢y4⁢z+724480⁢y6+149040⁢α⁢y4−215080⁢α⁢y3⁢z−1600⁢y4⁢z+670680⁢y3⁢α−208800⁢y4+732600⁢z⁢y3−4800⁢α⁢y2+3960⁢α⁢y⁢z+896⁢α⁢z2+984150⁢y3+298890⁢α⁢y−156735⁢α⁢z+6000⁢y2−16200⁢y⁢z+880⁢z2+96228⁢α−854550⁢y+1676700⁢z−393660,−314125516800⁢α⁢y9⁢z4−15975784120320⁢α⁢y10⁢z2−5536014336000⁢α⁢y9⁢z3+300987187200⁢y9⁢z4−546360629280768⁢α⁢y11−32882551603200⁢α⁢y10⁢z−10435297443840⁢α⁢y9⁢z2−322486272000⁢α⁢y6⁢z5−8668550430720⁢y10⁢z2−14135648256000⁢y9⁢z3+1967799836731392⁢α⁢y10+1947158001561600⁢α⁢y9⁢z−4917019852800⁢α⁢y7⁢z3+1310100480000⁢α⁢y6⁢z4−1139103470665728⁢y11−359455142707200⁢y10⁢z−524766413168640⁢y9⁢z2−725594112000⁢y6⁢z5+27199544370884352⁢α⁢y9+235447336673280⁢α⁢y8⁢z−14674245120000⁢α⁢y7⁢z2+163796824166400⁢α⁢y6⁢z3−37324800000⁢α⁢y3⁢z6−7560832848058368⁢y10−670150659686400⁢y9⁢z−39028901068800⁢y7⁢z3−7759825920000⁢y6⁢z4−7519204604620800⁢α⁢y8+3675750562759680⁢α⁢y7⁢z+227541778560000⁢α⁢y6⁢z2+66355200000⁢α⁢y4⁢z4−4534963200000⁢α⁢y3⁢z5+32041679675265792⁢y9−1409502931845120⁢y8⁢z−42639851520000⁢y7⁢z2−175841686425600⁢y6⁢z3−37324800000⁢y3⁢z6+2614664021875200⁢α⁢y7+16968987770878080⁢α⁢y6⁢z+5039700480000⁢α⁢y5⁢z2−129548782080000⁢α⁢y4⁢z3+21017180160000⁢α⁢y3⁢z4−7353752910796800⁢y8+257997550049280⁢y7⁢z−1314534666240000⁢y6⁢z2−213580800000⁢y4⁢z4−7054387200000⁢y3⁢z5−629856000000⁢α⁢x⁢z5+321705392979406400⁢α⁢y6−1018259361792000⁢α⁢y5⁢z+347786987328000⁢α⁢y4⁢z2+2203937994240000⁢α⁢y3⁢z3+139968000000⁢α⁢y⁢z5−209952000000⁢α⁢z6+46656000000⁢x⁢z6−107487335683180800⁢y7+39860784187015680⁢y6⁢z−2537233920000⁢y5⁢z2−380772679680000⁢y4⁢z3−209844224640000⁢y3⁢z4−18743464800000⁢α⁢x⁢z4−39416496242604800⁢α⁢y5+45006197725728000⁢α⁢y4⁢z+18852048082512000⁢α⁢y3⁢z2+4076179200000⁢α⁢y2⁢z3+58320000000⁢α⁢y⁢z4−15446376000000⁢α⁢z5+88088744959114400⁢y6−18392297260032000⁢y5⁢z−2230302304512000⁢y4⁢z2−3045221256960000⁢y3⁢z3+139968000000⁢y⁢z5+94478400000000⁢α⁢x⁢z3−23046304810528800⁢α⁢y4+163552851034668000⁢α⁢y3⁢z−32611248000000⁢α⁢y2⁢z2−528160248000000⁢α⁢y⁢z3−2927664000000⁢α⁢z4−38688904800000⁢x⁢z4−26046898913260800⁢y5−25470717458112000⁢y4⁢z+31476478240152000⁢y3⁢z2+11844403200000⁢y2⁢z3+6298560000000⁢y⁢z4−17937936000000⁢z5+5550200727030000⁢α⁢x⁢z2+841574249783608500⁢y3⁢α−11336483045680000⁢α⁢y2⁢z−1020432054600000⁢α⁢y⁢z2+6063266599200000⁢α⁢z3−737167716000000⁢x⁢z3−568616554967464800⁢y4+682176021898628000⁢z⁢y3+94950792000000⁢y2⁢z2−696965508000000⁢y⁢z3−870738012000000⁢z4+38444953961075000⁢α⁢x⁢z−104840997530040000⁢α⁢y2+95020410601170000⁢α⁢y⁢z+85139930065725000⁢α⁢z2−3875300052120000⁢x⁢z2−307559853657459000⁢y3−49118173405280000⁢y2⁢z−8777828946600000⁢z2⁢y−12373762321800000⁢z3+94086819258781500⁢α⁢x−200252907899415000⁢α⁢y+597219742017708750⁢α⁢z+84698873079075000⁢x⁢z−22027797731340000⁢y2−187882578562680000⁢y⁢z+109342506627225000⁢z2−17319759203700000⁢α+991358206562039625⁢x−1534072805076652500⁢y+2118938395306196250⁢z+48514014178143750,40326912⁢α⁢y9−205141248⁢y9+121150080⁢α⁢y6⁢z−51710400⁢α⁢y6+78382080⁢y6⁢z+10425600⁢α⁢y3⁢z2−2779336800⁢y6−460252800⁢α⁢y4+1331445600⁢α⁢y3⁢z−3960000⁢y3⁢z2−3596400⁢α⁢x⁢z2−1130633900⁢y3⁢α−378064800⁢y4−246564000⁢z⁢y3+42460200⁢α⁢x⁢z−39096000⁢α⁢y⁢z+42460200⁢α⁢z2−13032000⁢x⁢z2−7894611000⁢y3+1702428300⁢α⁢x−2617839000⁢α⁢y+3396141950⁢α⁢z+579121000⁢y⁢x−80919000⁢x⁢z+14850000⁢y⁢z−80919000⁢z2+92534400⁢α+238838625⁢x+22477500⁢y−2853557750⁢z+159225750,−896⁢α⁢y6−736⁢y6−80⁢α⁢y3⁢z−4860⁢y3⁢α−2240⁢z⁢y3−540⁢α⁢x⁢z+900⁢y3−1440⁢α⁢x+300⁢α⁢y−2880⁢α⁢z+7610⁢x2+100⁢x⁢z−960⁢α−6075⁢x+8400⁢y−12150⁢z−4050
Amrhein, B.; Gloor, O.; and Kuchlin, W. "On the Walk." Theoretical Comput. Sci., Vol. 187, (1997): 179-202.
Collart, S.; Kalkbrener, M.; and Mall, D. "Converting Bases with the Grobner Walk." J. Symbolic Comput., Vol. 3, No. 4, (1997): 465-469.
Tran, Q.N. "A Fast Algorithm for Grobner Basis Conversion and Its Applications." J. Symbolic Comput., Vol. 30, (2000): 451-467.
See Also
Basis
FGLM
Download Help Document