In this paper we will give a new efficient method for factorizing differential operators with rational functions coefficients. This method solves the main problem in Beke's factorization method, which is the use of splitting fields and/or Gröbner basis.
Factoring polynomials with rational coefficients
✍ Scribed by A. K. Lenstra; H. W. Lenstra; L. Lovász
- Publisher
- Springer
- Year
- 1982
- Tongue
- English
- Weight
- 970 KB
- Volume
- 261
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The ring of polynomials in \(X, X_{1}, \ldots, X_{m}\) are denoted by \(\mathbf{F}_{p}\left[X, X_{1}, \ldots, X_{m}\right]\) in \(F_{p}\), that is the field of integers defined modulo \(p\). In the usual factorization algorithm defined by Wang, the given polynomial \(P\) is first factorized modulo \
We consider generalized Vandermonde determinants of the form vs;.(xl .... ,xs) = Ix~'~l, 1\_< i, k < s, where the x~ are distinct points belonging to an interval [a, b] of the real line, the index s stands for the order, the sequence # consists of ordered integers 0 <\_ #1 < ~2 < • " < Ps. These de