id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
18106,QQbar: make sum and product n-ary and remove recursive calls,vdelecroix,,"In QQbar, there are currently many operations that involve recursive calls. For example, this rather simple example gives an error because the Python stack gets filled:
{{{
sage: a = QQbar.zeta(1009)
sage: p = cyclotomic_polynomial(1009)
sage: b = p(a)
sage: b
0.?e-12 + 0.?e-12*I
sage: b == 0
Traceback (most recent call last):
...
RuntimeError: maximum recursion depth exceeded
}}}
In this ticket:
- introduce a new (one variable) polynomial descriptor
- we make sum and product be n-ary operators instead of binary
- we remove all recursive call to become depth first search
The current behavior prevents avoiding lazy fields (RLF and CLF) for number field embeddings (see e.g. #18103).",defect,new,major,sage-6.6,number fields,,"sd66, qqbar",gagern,,,,N/A,,,,,