-
on https://www.lmfdb.org/padicField/11.6.4.2 we have `x^2 - x + 7`
but on https://beta.lmfdb.org/padicField/11.6.4.2 we have `x^2 + 7*x + 2`
and the tests expect the former: https://github.com/LMFDB…
-
Currently, one can emulate the Iverson Bracket in this way:
```python
def IversonBracket(expr):
return Piecewise((1, expr),(0,True))
```
which looks the following way when pretty-printed:
…
-
Notes from Gary:
> if vertices x and y have n edges joining them. their tutte polynomial is
>
> T(G with n (x,y) edges, x,y) = G with one (x.y) edge, x, y) + (y^{n-1} + y^{n - 2} + ... + y^{2} +…
-
@MikaelSlevinsky's transform work by first expanding in a tensor product basis, which contains non-polynomial terms, before transforming to a polynomial basis. For example, to compute OPs on the trian…
-
## Description
In [`src/considerations/rootfinding.md`](https://github.com/ArdanaLabs/audit/blob/main/src/considerations/rootfinding.md) at this time, I make a conjecture (emph added):
> 4. **Sh…
-
Part of metaticket #12024.
Just a bunch of little classes for working with "optimized" polynomials, which is actually used somewhere, evidently. Not a single example. Either doctest it completely…
-
(With contributions from @tlycken) There is lots of room for improvement in our test suite. Here are some areas that are in need of improvement:
- Vector-valued indexing (ref #24, #54). Test that inde…
-
I have found that when dividing by a polynomial divisible by a large power of x, by a linear polynomial, it takes too much time. The algorithm is thus, no longer linear in the degree of polynomial
…
-
You're absolutely right! I apologize for my oversight. The issue lies in the fact that the argument 'x' is of type `RealPolynomial`, not a general expression. When dividing polynomials, the result is …
-
Over Z/nZ it is possible to end up with greater precision when powering power series than when doing it over Z or some other integral domain.
This is because the binary exponentiation method, for e…