|
D.15.11.4 facFirstShift
Procedure from library ncfactor.lib (see ncfactor_lib).
- Usage:
- facFirstShift(h); h a polynomial in the first shift algebra
- Return:
- list
- Purpose:
- compute all factorizations of a polynomial in the first shift algebra
- Theory:
- Implements the new algorithm by A. Heinle and V. Levandovskyy, see the thesis of A. Heinle
- Assume:
- basering in the first shift algebra
- Note:
- Every entry of the output list is a list with factors for one possible factorization.
Example:
| LIB "ncfactor.lib";
ring R = 0,(x,s),dp;
def r = nc_algebra(1,s);
setring(r);
poly h = (s^2*x+x)*s;
facFirstShift(h);
==> [1]:
==> [1]:
==> 1
==> [2]:
==> xs2+2s2+x
==> [3]:
==> s
==> [2]:
==> [1]:
==> 1
==> [2]:
==> s2+1
==> [3]:
==> x
==> [4]:
==> s
==> [3]:
==> [1]:
==> 1
==> [2]:
==> s
==> [3]:
==> xs2+s2+x-1
==> [4]:
==> [1]:
==> 1
==> [2]:
==> s
==> [3]:
==> s2+1
==> [4]:
==> x-1
==> [5]:
==> [1]:
==> 1
==> [2]:
==> s3+s
==> [3]:
==> x-1
==> [6]:
==> [1]:
==> 1
==> [2]:
==> s2+1
==> [3]:
==> s
==> [4]:
==> x-1
==> [7]:
==> [1]:
==> 1
==> [2]:
==> xs3+2s3+xs
| See also:
facFirstWeyl;
facSubWeyl;
testNCfac.
|