forked from fricas/fricas
-
Notifications
You must be signed in to change notification settings - Fork 0
/
xpfact.spad
604 lines (567 loc) · 20.8 KB
/
xpfact.spad
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
)abbrev package XPFACT XPolynomialFactor
XPolynomialFactor(vl : OrderedSet, F : Field) : Exports == Implementation where
G ==> Polynomial(F)
XDP ==> XDistributedPolynomial(vl, F)
YDP ==> XDistributedPolynomial(vl, G)
fM ==> FreeMonoid(vl)
lift_rec ==> Record(l_fac : YDP, r_fac : YDP, residual : YDP,
nsym : Union(Symbol, "none"))
GCD_rec ==> Record(g : XDP, c1 : XDP, c2 : XDP, cu : XDP, cv : XDP)
d_rec ==> Record(quotient : XDP, remainder : XDP)
Exports ==> with
homo_fact : XDP -> List(XDP)
++ homo_fact(p) factors homogeneous polynomial p into irreducible
++ factors.
top_split : XDP -> List(XDP)
++ top_split(p) returns [p1, p2] where p1 is homogeneous part of
++ p of maximal degree and p2 is sum of lower order terms of p.
left_ext_GCD : (XDP, XDP) -> Union(GCD_rec, "failed")
++ left_ext_GCD(a, b) returns [g, u0, v0, u, v] where
++ g is left GCD of a and b, g = a*u0 + b*v0 and
++ au = - bv is least common right multiple of a and b
++ when a and b have least common right multiple.
++ Otherwise left_ext_GCD(a, b) returns "failed".
ldivide : (XDP, XDP) -> d_rec
++ ldivide(a, b) returns [c, r] such that a = b*c + r, r is
++ is of minimal possible degree and homogeneous part of
++ of r of maximal degree contains no terms divisible from
++ left by leading term of b.
if F has PolynomialFactorizationExplicit then
factor : XDP -> List(XDP)
++ factor(p) returns a factorization of p into irreducible
++ factors. Note: in general thare are finitely many
++ nonequivalent factorizations into irreducible factors,
++ this routine returns only one.
Implementation ==> add
Tm ==> Record(k: fM, c: F)
Tm2 ==> Record(k: fM, c: G)
lT ==> List(Tm)
lT2 ==> List(Tm2)
NNI ==> NonNegativeInteger
RG ==> Fraction(G)
EqRG ==> Equation(RG)
sol_pack ==> SystemSolvePackage(F)
my_degree(p : XDP) : Integer ==
p = 0 => -1
degree(p)
-- split p into homogeneous part of maximal degree and lower order terms
top_split(p) ==
d := degree(p)
d = 0 => [p, 0$XDP]
lt := listOfTerms(p)
lt1 := [r for r in lt | length(r.k) = d]
lt2 := [r for r in lt | length(r.k) < d]
p1 := construct(lt1)$XDP
p2 := construct(lt2)$XDP
[p1, p2]
-- d_rec ==> Record(quotient : XDP, remainder : XDP)
ldivide(x : XDP, y : XDP) : d_rec ==
w := maxdeg(y)
ilc := 1/leadingCoefficient(y)
dy := degree(y)
dx := my_degree(x)
dx < dy => [0, x]
qq := 0$XDP
repeat
tx := top_split(x)
q1 := ilc*lquo(first(tx), w)
x := x - y*q1
qq := qq + q1
ndx := my_degree(x)
ndx = dx or ndx < dy => return [qq, x]
dx := ndx
lexquo(x : XDP, y : XDP) : Union(XDP, "failed") ==
(q, r) := ldivide(x, y)
r = 0 => q
"failed"
left_ext_GCD(a : XDP, b : XDP) : Union(GCD_rec, "failed") ==
u0 := v := 1$XDP
v0 := u := 0$XDP
while b ~= 0 repeat
-- print(message("ldivide")$OutputForm)$OutputForm
-- print(a::OutputForm)$OutputForm
-- print(b::OutputForm)$OutputForm
(q, r) := ldivide(a, b)
-- print(r::OutputForm)$OutputForm
not(my_degree(r) < degree(b)) => return "failed"
(a, b) := (b, r)
(u0, u):= (u, u0 - u*q)
(v0, v):= (v, v0 - v*q)
[a, u0, v0, u, v]
-- find lowest degree factor of homogeneous polynomial p
-- returns list of factor and quotient or empty list
-- if p is irreducible
homo_fact1(p1 : XDP) : List(XDP) ==
n := numberOfMonomials(p1)
lw2 := maxdeg(p1)
c0 := leadingCoefficient(p1)
lw1 := 1$fM
length(lw2) = 0 => []
while length(lw2) > 0 repeat
lw1 := lw1*(first(lw2)::fM)
lw2 := rest(lw2)
length(lw2) = 0 => break
rf := lquo(p1, lw1)
n2 := numberOfMonomials(rf)
n1u := n exquo n2
n1u case "failed" => iterate
n1 := n1u@Integer
lf := rquo(p1, lw2)
(n1 ~= numberOfMonomials(lf)) => iterate
lf := (1/c0)*lf
p1 = lf*rf => return [lf, rf]
[]
-- factor homogeneous polynomial into irreducible factors
homo_fact(p) ==
res : List(XDP) := []
repeat
fl1 := homo_fact1(p)
-- print(fl1)
empty?(fl1) =>
res := cons(p, res)
res := reverse(res)
-- print("returning")
-- print(res)
return res
p1 := first(fl1)
res := cons(p1, res)
p := first(rest(fl1))
res
XDP_to_YDP(p : XDP) : YDP ==
lt := listOfTerms(p)
lt2 : lT2 := []
for t in lt repeat
lt2 := cons([t.k, (t.c)::G]$Tm2, lt2)
lt2 := reverse!(lt2)
construct(lt2)$YDP
eval_YDP(p : YDP, ls : List(Symbol), lval : List(F)) : XDP ==
lt := listOfTerms(p)
lt2 : lT := []
for t in lt repeat
nc := ground(eval(t.c, ls, lval))
nc = 0 => iterate
lt2 := cons([t.k, nc]$Tm, lt2)
construct(lt2)$XDP
SUP ==> SparseUnivariatePolynomial(F)
eval_sup(p1 : SUP, w : XDP) : XDP ==
res : XDP := 0
od : Integer := -1
while p1 ~= 0 repeat
c := leadingCoefficient(p1)
nd := degree(p1)
for i in nd..(od - 1) repeat
res := w*res
res := res + c::XDP
p1 := reductum(p1)
od := nd
for i in 1..od repeat
res := w*res
res
restn(w : fM, j : Integer) : fM ==
for i in 1..j repeat w := rest(w)
w
firstn(w : fM, j : Integer) : fM ==
res := 1$fM
for i in 1..j repeat
res := res*(first(w)::fM)
w := rest(w)
res
my_ground(fr : RG) : F ==
ground(numer(fr))/ground(denom(fr))
rational_solution1(eq : EqRG) : List(RG) ==
le := lhs(eq)
denom(le) ~= 1$G => []
nl := numer(le)
totalDegree(nl) ~= 1 or reductum(nl) ~= 0 => []
re := rhs(eq)
nr := numer(re)
not(ground?(nr)) => []
dr := denom(re)
not(ground?(dr)) => []
[le, (((1/leadingCoefficient(nl))*my_ground(re))::G)::RG]
rational_solution(leq : List(EqRG), ls : List(Symbol)) : List(F) ==
-- print leq
-- print ls
sol : List(F) := []
for eq in leq for s in ls repeat
empty?(sol1 := rational_solution1(eq)) => return []
v := first(variables(numer(first(sol1))))
s ~= v => error "strange solution"
sol := cons(my_ground(first(rest(sol1))), sol)
reverse(sol)
-- find solutions in base field
-- assumes that equations have only finite number of solutions
get_rational_solution(lsol : List(List(EqRG)), ls : List(Symbol)
) : List(F) ==
for leq in lsol repeat
if not(empty?(sol := rational_solution(leq, ls))) then
return [sol]
[]
Alg_rec ==> Record(pol : G, sol1 : List(F))
algebraic_solution(leq : List(EqRG), alg_sym : Symbol,
ls : List(Symbol)) : Union(Alg_rec, "failed") ==
sol1 := rational_solution(rest(leq), ls)
empty?(sol1) =>
"failed"
eq1 := first(leq)
eqf := lhs(eq1) - rhs(eq1)
eq := numer(eqf)
v_lst := variables(eq)
v_lst = [alg_sym] => [eq, sol1]
"failed"
get_algebraic_solution(lsol : List(List(EqRG)), alg_sym : Symbol,
ls : List(Symbol)) : Union(Alg_rec, "failed") ==
for leq in lsol repeat
sol := algebraic_solution(leq, alg_sym, ls)
sol case Alg_rec =>
return sol
"failed"
my_mul(l : List(XDP)) : XDP ==
l := reverse l
res := first(l)
for p in rest(l) repeat
res := p*res
res
overlap_steps(ll : List(XDP), rl : List(XDP)) : List(Integer) ==
res : List(Integer) := []
p1 := last(ll)
d := degree(p1)
kk := #ll
for p2 in rl for k in 1..kk repeat
if p2 = p1 then
if first(rl, k) = rest(ll, (kk - k)::NNI) then
res := cons(d, res)
d := d + degree(p2)
reverse(res)
-- solve lift equation for one step of lifting
lift1(lw : fM, lfy : YDP, d1 : Integer, rw : fM, rfy : YDP, j : Integer,
lc : F, rp : YDP, o_case : Boolean) : lift_rec ==
nsu : Union(Symbol, "none") := "none"
lcw := restn(lw, d1 - j)
rop := lquo(rfy, lcw)
if rop = 0 then
rf1p := lquo(rp, lw)
rf1 := (1/lc)::G*rf1p
rp := rp - lfy*rf1
lf1 := rquo(rp, rw)
rp := rp - lf1*rfy
else
rcw := firstn(rw, j)
lop := rquo(lfy, rcw)
row := lw*maxdeg(rop)
if (lop = 0) or (row < (low := maxdeg(lop)*rw)) then
lf1 := rquo(rp, rw)
rp := rp - lf1*rfy
rf1p := lquo(rp, lw)
rf1 := (1/lc)::G*rf1p
rp := rp - lfy*rf1
else if low < row then
-- the same as rop = 0
rf1p := lquo(rp, lw)
rf1 := (1/lc)::G*rf1p
rp := rp - lfy*rf1
lf1 := rquo(rp, rw)
rp := rp - lf1*rfy
else if o_case then
-- print "overlap"
ns := new()$Symbol
nsu := ns
nc := monomial(1, ns, 1)$G
oc := coefficient(rp, low)
rf1p := lquo(rp, lw)
rf1 := (1/lc)::G*rf1p
lf1 := rquo(rp, rw)
rf1 := rf1 + nc*rop
lf1 := lf1 - ((oc/lc)::G + nc)*lop
rp := rp - lfy*rf1 - lf1*rfy
else
-- print "false overlap"
-- print low
oc := coefficient(rp, low)
dif_p := lfy*rop - lop*rfy
dif_p = 0 => error "impossible 1"
dw := maxdeg(dif_p)
dw >= low => error "impossible 2"
dc := coefficient(rp, dw)
rdc : F := 0
ldc : F := 0
ldc0 : G :=
(rqu := lquo(dw, lw)) case "failed" => 0
rdc := ground(coefficient(rop, rqu@fM))
(1/lc)*dc
rdc0 : G :=
(lqu := rquo(dw, rw)) case "failed" => 0
ldc := ground(coefficient(lop, lqu@fM))
dc
piv2 := rdc - 1
piv2 = 0 => error "impossible 3"
nc2 := (1/piv2)*(dc - ldc0 - rdc0 + ldc*oc)
nc1 := -oc - nc2
rf1p := lquo(rp, lw)
rf1 := (1/lc)::G*rf1p
rf1 := rf1 + nc1*rop
lf1 := rquo(rp, rw)
lf1 := lf1 + nc2*lop
rp := rp - lfy*rf1 - lf1*rfy
[lf1, rf1, rp, nsu]
if F has PolynomialFactorizationExplicit then
dummy := create()$SingletonAsOrderedSet
-- Find factor of form P(t), where t is noncommutative
-- with no overlaps in top part and P is irreducible
-- commutative polynomial
dc_fact11(lf : XDP, lrl : List(YDP), eqs : List(G)
) : Union(XDP, "failed") ==
-- print(eqs::OutputForm)$OutputForm
ueqs := [univariate(eq) for eq in eqs]
eq1 := gcd(ueqs)
degree(eq1) < 1 => "failed"
-- print(eq1::OutputForm)$OutputForm
feq := factor(eq1)
fl := factorList(feq)
md := min([degree(fr.factor) for fr in fl])
-- print(lrl::OutputForm)$OutputForm
tt := -univariate(constant(first(lrl)))
degree(tt) > 1 => error "degree(tt) > 1"
tt0 := coefficient(tt, 0)
tt1 := leadingCoefficient(tt)
inv_tt := (1/tt1)*(monomial(1,1)$SUP - tt0::SUP)
for fr in fl repeat
fac := fr.factor
degree(fac) > md => iterate
nfac := eval(fac, dummy, inv_tt)
-- print(nfac::OutputForm)$OutputForm
w := lf + eval_YDP(reduce(_+, rest(lrl), 0$YDP), [], [])
return eval_sup(nfac, w)
error "impossible"
dc_fact12(lf : XDP, lrl : List(YDP), eq : G,
sol1 : List(F), ls : List(Symbol)
) : XDP ==
ueq := univariate(eq)
tt := -univariate(constant(first(lrl)))
degree(tt) > 1 => error "degree(tt) > 1"
tt0 := coefficient(tt, 0)
tt1 := leadingCoefficient(tt)
inv_tt := (1/tt1)*(monomial(1,1)$SUP - tt0::SUP)
nfac := eval(ueq, dummy, inv_tt)
w := lf + eval_YDP(reduce(_+, rest(lrl), 0$YDP), ls, sol1)
eval_sup(nfac, w)
Fact1 ==> Union(List(XDP), XDP, "failed")
-- tries to extend factorization of homogeneous part of
-- maximal degree to full factorization
-- d is degree of homogeneous part
-- lc is coefficient of leading term
-- ll gives factorization of homogeneous part of left factor
-- rl gives factorization of homogeneous part of right factor
-- rs are lower order terms
-- returns list of factors or "failed" if there are no factorization
-- with given homogeneous part
dc_fact1(d : NNI, lc : F, ll : List(XDP), rl : List(XDP),
rs : XDP) : Fact1 ==
lf := lc*my_mul(ll)
rf := my_mul(rl)
lfy := XDP_to_YDP(lf)
rfy := XDP_to_YDP(rf)
d1 := degree(lf)
d2 := degree(rf)
lw := maxdeg(lf)
rw := maxdeg(rf)
md := min(d1, d2)
lovl := overlap_steps(ll, rl)
lovl := concat(lovl, md + 1)
ovls := first(lovl)
lovl := rest(lovl)
lrl : List(YDP) := []
rrl : List(YDP) := []
eqs : List(G) := []
-- print lf
-- print rf
ls : List(Symbol) := []
alg_case : Boolean := true
alg_case2 : Boolean := false
for j in 1..md repeat
-- print "step"
-- print j
o_case := false
if j = ovls then
o_case := true
ovls := first(lovl)
lovl := rest(lovl)
rp : YDP := -reduce(_+, [lr1*rr1 for lr1 in lrl for rr1 in rrl], 0)
if d - j = my_degree(rs) then
ts := top_split(rs)
rp := rp + XDP_to_YDP(first(ts))
rs := first(rest(ts))
-- solve lift equation for one step of lifting
(lf1, rf1, rp, nsu) := lift1(lw, lfy, d1, rw, rfy, j,
lc, rp, o_case)
if nsu case Symbol then
ls := cons(nsu@Symbol, ls)
if j < md then alg_case := false
if j = md then alg_case2 := true
-- print lf1
-- print rf1
-- print rp
eqs := concat(eqs, coefficients(rp))
lrl := cons(lf1, lrl)
rrl := concat(rrl, rf1)
if d1 > d2 then
for j in (md + 1)..d1 repeat
-- print "step"
-- print j
rp : YDP := -reduce(_+, [lr1*rr1 for lr1 in lrl for rr1 in rrl])
if d - j = my_degree(rs) then
ts := top_split(rs)
rp := rp + XDP_to_YDP(first(ts))
rs := first(rest(ts))
lf1 := rquo(rp, rw)
-- print lf1
rp := rp - lf1*rfy
-- print rp
eqs := concat(eqs, coefficients(rp))
lrl := cons(lf1, lrl)
rrl1 := rrl
if d2 > d1 then
for j in (md + 1)..d2 repeat
-- print "step"
-- print j
rp : YDP := -reduce(_+, [lr1*rr1 for lr1 in lrl for rr1 in rrl1])
if d - j = my_degree(rs) then
ts := top_split(rs)
rp := rp + XDP_to_YDP(first(ts))
rs := first(rest(ts))
rf1 := lquo(rp, lw)
rf1 := (1/lc)::G*rf1
rp := rp - lfy*rf1
-- print rf1
-- print rp
eqs := concat(eqs, coefficients(rp))
rrl := concat(rrl, rf1)
rrl1 := rest(concat(rrl1, rf1))
for j in (max(d1, d2) + 1)..d repeat
rp : YDP := -reduce(_+, [lr1*rr1 for lr1 in lrl for rr1 in rrl1])
if d - j = my_degree(rs) then
ts := top_split(rs)
rp := rp + XDP_to_YDP(first(ts))
rs := first(rest(ts))
-- print rp
eqs := concat(eqs, coefficients(rp))
rrl1 := rest(rrl1)
empty?(eqs) =>
empty?(ls) =>
lf := lf + eval_YDP(reduce(_+, lrl), [], [])
rf := rf + eval_YDP(reduce(_+, rrl), [], [])
[lf, rf]
error "impossible"
-- print eqs
empty?(ls) => "failed"
alg_case =>
#ls ~= 1 => error "impossible"
au := dc_fact11(lf, lrl, eqs)
au case "failed" => "failed"
au@XDP
lsol := solve([eq::RG for eq in eqs], ls)$sol_pack
sol := get_rational_solution(lsol, ls)
empty?(sol) =>
alg_case2 =>
alg_sym := first(ls)
ls := rest(ls)
solu := get_algebraic_solution(lsol, alg_sym, ls)
solu case "failed" => "failed"
solr := solu@Alg_rec
dc_fact12(lf, lrl, solr.pol, solr.sol1, ls)
"failed"
-- print sol
lf := lf + eval_YDP(reduce(_+, lrl), ls, sol)
rf := rf + eval_YDP(reduce(_+, rrl), ls, sol)
[lf, rf]
-- factor p, returns list of factors
-- finds single factorization into irreducible factors
factor(p) ==
(dd := my_degree(p)) <= 1 => [p]
d := dd::NNI
ts := top_split(p)
tp := first(ts)
rs := first(rest(ts))
lc := leadingCoefficient(tp)
tp := (1/lc)*tp
rf := homo_fact(tp)
rf0 := rf
lf : List(XDP) := []
res : List(XDP) := []
repeat
lf := concat(lf, first(rf))
rf := rest(rf)
empty?(rf) =>
res := cons(p, res)
break
-- print "trying"
-- print d
-- print lc
-- print lf
-- print rf
-- print rs
fu := dc_fact1(d, lc, lf, rf, rs)
-- print fu
if fu case List(XDP) then
fl := fu@List(XDP)
res := cons(first(fl), res)
p := first(rest(fl))
ts := top_split(p)
lc := leadingCoefficient(p)
d := my_degree(p)::NNI
rs := first(rest(ts))
lf := []
rf0 := rf
if fu case XDP then
f1 := fu@XDP
pu := lexquo(p, f1)
pu case "failed" => error "lexquo(p, f1)"
p1 := pu@XDP
d1 := my_degree(p1)::NNI
d1 = 0 =>
res := cons(p, res)
break
p := p1
res := cons(f1, res)
lc := leadingCoefficient(p)
ts := top_split(p)
rs := first(rest(ts))
lf := []
while d > d1 repeat
p1 := first(rf0)
rf0 := rest(rf0)
d := (d - degree(p1))::NNI
d < d1 => error "d < d1"
rf := rf0
reverse(res)
-- a2 := x*y - y*x
-- a3 := x*y*z - x*z*y + z*x*y - z*y*x + y*z*x - y*x*z
-- (x+y+z)^4+x*y*z*x
-- ((x+y+z)^2+x*y)*((x+y+z)^2+y*x)
)if false
factor(4*x*x-9)
factor(x*x-9/4)
factor((x - 2)*(x - 3)*(x - 5)*(x - 7))
factor((x^2 + 5)*(x^2 + x + 7))
factor((2*x^2 +3*x - 4)*(3*x^2 - x - 7))
factor((x^2 + 5)*(x^3 + x + 7))
factor((x^3 + 5)*(x^3 + x + 7))
-- Was very long time: 2397.40 sec
factor((x^4 + 5)*(x^4 + x + 7))
-- Was very long time: 2510.13 sec
factor(((x^2+y)^4 + 5)*((x^2+y)^4 + (x^2+y) + 7))
factor(((2*x^2+y)^4 + 5)*((2*x^2+y)^4 + (2*x^2+y) + 7))
-- quite large, multiplication takes 233.30 sec
-- and produces 293573 monomials
-- needs 1940.88 sec
-- factor(((a2^2+y)^4 + 5)*((a2^2+y)^4 + (a2^2+y) + 7))
factor((x^3 + x + 7)*a3*a2)
factor((x^3 + x + 7)*(a3*a3 + 7))
factor((a2^2 - 2)*(a2^2 - 3)*(a2^2 - 5))
factor((a3^2 - 2)*(a3^2 - 3)*(a3^2 - 5))
factor((3+x*z*y)*a3)
factor(a3*(1+y))
-- Two different factorizations
factor((x^2*y - y + 1)*(y*x^2 + x^2 - y))
factor((x^2*y + x^2 - y)*(y*x^2 - y + 1))
)endif