-
What about skipping the Galois group and introducing the Galois groupoid, instead? Is there any reason to artificially single out a particular splitting field?
-
Sorry if this isn't the right place (ie, do Documentation Issues go here?), but the function flattenRing asserts:
> write a ring as a (quotient) of a polynomial ring over ZZ or a prime field
How…
-
Magma is really good at computing Galois groups. We should improve our interface so that we can take advantage of it when available.
Depends on #31489
Component: **number fields**
_Issue created…
-
When inputting `4` as field bound, the calculator assumes `Z_4`, which is not a finite field, instead of `GF(4)`, which is.
I would recommend making it explicit that this calculator works with the …
skius updated
4 years ago
-
Currently `RationalField` has significantly less functionality then `NumberField_relative` and
`NumberField_absolute` . This is annoying since this means that if you want to write code that works …
-
`hmatrix` is the Haskell de-facto standard for matrix operations over real and complex numbers in Haskell. Some applications are requiring matrices over arbitrary fields; specifically over finite fiel…
-
I'm all in favour of typechecking in python and turn it on almost always. So in principle I love the inclusion of `py.typed` in the latest release of this library.
However, it seems that the type …
-
The following example, about which I was told by @nzidaric, does not work:
```
F:=GF(2);
x:=Indeterminate(F,"x");
poly:=RandomPrimitivePolynomial(F,17);
K:=FieldExtension(F,poly);
r:=Random(K);
…
-
A finite ring R is said to be a chain ring, if its set of left ideals form a chain.
This class of rings is very important in coding theory since it contains
finite fields, integer residue rings of …
-
Kokke! Thanks for the project, looks great!
A few questions:
1. Can it be used on big endian machines with same results?
2. In `ecdh.h` two curves `NIST_K409` and `NIST_K571` are marked as not …