Let A be a G-algebra.
Current localization types:
Type 0: monoidal
- represented by a list of polys g_1,...,g_k that have to be contained in a
commutative polynomial subring of A generated by a subset of the variables
of A
Type 1: geometric
- only for algebras with an even number of variables where the first half
induces a commutative polynomial subring B of A
- represented by an ideal p, which has to be a prime ideal in B
Type 2: rational
- represented by an intvec v = [i_1,...,i_k] in the range 1..nvars(basering)
Localization data is an int specifying the type and a def with the
corresponding information.
A fraction is represented as a vector with four entries: [s,r,p,t]
Here, s^{-1}r is the left fraction representation, pt^{-1} is the right one.
If s or t is zero, it means that the corresponding representation is not set.
If both are zero, the fraction is not valid.
A detailed description along with further examples can be found in our paper:
Johannes Hoffmann, Viktor Levandovskyy:
Constructive Arithmetics in Ore Localizations of Domains
https://arxiv.org/abs/1712.01773
Online Manual
