> Are these rings generally used? Sage has special support for binary
> matrices, should it also have something similar for "binary power rings"?
The rings I use are products of IntegerModRing and finite fields. I
gave this example for the bug report, as the actual construction is
long and useless
On Mon, 28 Sep 2015, Nathann Cohen wrote:
Just look. This is the time it takes to build the addition table of
(Z/2Z)^8 (contains 256 elements) when you define it through products:
Are these rings generally used? Sage has special support for binary
matrices, should it also have something simil
Hello,
Indeed!! See #19299.
Vincent
On 28/09/15 09:57, Nathann Cohen wrote:
Hello guys,
I write this post to alert those who know the code and could do something
about it.
As you know I study graph theory, and I have to go out of my comfort zone
rather regularly. These days, it led me to def
Hello guys,
I write this post to alert those who know the code and could do something
about it.
As you know I study graph theory, and I have to go out of my comfort zone
rather regularly. These days, it led me to define products of rings and run
some computations of them (mostly additions). The p
