Tommy Hofmann
Tommy Hofmann
> ## 1. Representation of the databases > Each "database" could either be represented by an object, or by singleton type. Example: `TransitiveGroupsDB` (or `TransitiveGroupsLibrary`, or whatever). > > For...
I don't see the problem of defining ```julia coefficient_ring(I::MPolyIdeal) = coefficient_ring(base_ring(I)) ``` to get the `K` in `K[x]` given an ideal. Is this what you are after? Or are you...
I don't think there is a generic factorization implementation yet.
So in general we have a reduction F[x1, ..., xn] -> F[x]. But for fraction fields F as here we could do the reduction F[x] -> F[x1,] (univariate to fake...
I think it is fine. Do you see possible problems down the road?
I don't know. If I remember correctly, at some point this was moved from Hecke to AA. So maybe @fieker has an opinion on what the behaviour should be and...
We don't have it in Hecke yet, but after talking to @fieker, we decided to add it soon.
In case what @fingolfin is not possible, I would suggest we keep the "new names" you listed above for the moment.
I agree and just want to note that for some of these cases we can do aliases, but I would not want to do it for the types. I don't...
The way the aliases are setup, you can do both. But I think we should suggest overloading not the alias version. I hope that we are moving to a `snake_case`...