-
After the latest "opam update" I'm getting the folllowing message:
```
The brute-force exploration algorithm timed-out [97 states, 5s].
You might need to add explicit version constraints to your requ…
-
It's now 2x slower than assembly. Looks like deinterleaving is failing to trigger. This needs some love.
-
```
multiset_partitions does not seem to be generating all possible partitions.
In particular, if I use this function to enumerate factorings of 672 it does not find 2*2*8*21
Also, some of the parti…
-
I tried to write som test code for linear algebra but it failed because of `ishermitian` and `issymmetric`. For example
```
julia> for i = 1:20
mA=randn(5,5)
println(issym(mA'mA))
…
-
Let `FM` be a combinatorial free module currently creating elements using the basis is very slow because the family is recreated each time:
```
sage: FM = CombinatorialFreeModule(QQ, ZZ)
sage: %tim…
-
A special case of #7303 ( which is much easier and efficient to implement ) is to find a strongly connected orientation of the edges of a bridgeless connected graph.
This can be done using the shor…