user202729
user202729
### Steps To Reproduce ``` sage: var("x") ....: f = (1/x+sqrt(x+1)).series(x) x sage: f 1*x^(-1) + 1 + 1/2*x + (-1/8)*x^2 + 1/16*x^3 + (-5/128)*x^4 + 7/256*x^5 + (-21/1024)*x^6 +...
As in the title. Currently it raises `ArithmeticError`, which leads to `QQ.nilradical()`, `ZZ.nilradical()` etc. complains as well. (should we?) The rationale is that the radical of the zero ideal is...
### Problem Description make the following work ``` sage: R. = LaurentSeriesRing(QQ) sage: (x^2).is_square() ``` ### Proposed Solution `PowerSeriesRing` already have an implementation of `is_square` and `sqrt`, it suffices to...
### Steps To Reproduce ``` sage: R. = PowerSeriesRing(Zmod(16)) sage: ((x+4)^2).is_square() False ``` ### Expected Behavior returns True We have a few ways around this. Either implement it, or make...
Picking up https://github.com/sagemath/sage/pull/40070 as far as I can tell the fedora:42 failure is irrelevant. ### :memo: Checklist - [ ] The title is concise and informative. - [ ] The...
improvement of https://github.com/sagemath/sage/pull/40056 . I keep the tests and modify the implementation. most of the complexity comes from: * we want to avoid calling `echelon_form()` at all if the user...
Fix https://github.com/sagemath/sage/issues/30379 . The implementation mimic `acb_calc_func_callback`. also increase tolerance for a few parts, since the CI system is somewhat unreliable (I've seen a 2.00 being 2.04). I guess 0.1s...
If you try to execute the following ``` sage: H. = AffinePlaneCurveArrangements(QQ) sage: A = H(y^2 + x, y + x - 1, x) sage: A.fundamental_group() ``` without sirocco, previously,...
Before: ``` sage: a = ZZ(5) sage: %timeit a + 1r 295 ns ± 5.14 ns per loop (mean ± std. dev. of 7 runs, 1,000,000 loops each) sage: %timeit...
follow up to https://github.com/sagemath/sage/pull/41057 My machine has `sizeof(mp_limb_t) == sizeof(UInt)` true, but I've tested both branches by changing the `if ...` to `if False` and see that the tests pass....