The tensor product of polynomials. (English) Zbl 1017.12003
From the text: In order to determine whether there exists a tensor decomposition of the natural module for a matrix group \(G\) over a field \(K\) it proved to be useful to decide whether or not there exists a tensor decomposition of the characteristic polynomial of \(g\in G\) [C. R. Leedham-Green and E. A. O’Brien, Int. J. Algebra Comput. 7, 541-559 (1997; Zbl 0907.20025)]. This latter problem was the motivation for the present work.
Let \(h\) be a univariate polynomial of degree \(d\) over an algebraically closed field \(K\). If \(d=m+n\) then clearly \(h\) is the product of two polynomials over \(K\) of degrees \(m\) and \(n\). But if \(d=mn\), with \(m,n>1\), then \(h\) is the tensor product (as defined below) of two polynomials, one of degree \(m\) and the other of degree \(n\), if and only if the coefficients \(c_1,\dots, c_d\) of \(h\) define an element \((c_1,\dots, c_d)\) in some \((m+n-1)\)-dimensional variety \(V \subset K^d\). This variety is determined by a prime ideal \(I_{mn}\) in the ring \(K[c_1, \dots, c_d]\). The ideal \(I_{22}\) is easily computed by hand and the ideal \(I_{32}\) is just within the range of machine computation.
Using Gröbner basis algorithms in MAGMA we find necessary and sufficient conditions for a polynomial of degree 6 over any field to be the tensor product of two polynomials, one of degree 3 and one of degree 2.
Let \(h\) be a univariate polynomial of degree \(d\) over an algebraically closed field \(K\). If \(d=m+n\) then clearly \(h\) is the product of two polynomials over \(K\) of degrees \(m\) and \(n\). But if \(d=mn\), with \(m,n>1\), then \(h\) is the tensor product (as defined below) of two polynomials, one of degree \(m\) and the other of degree \(n\), if and only if the coefficients \(c_1,\dots, c_d\) of \(h\) define an element \((c_1,\dots, c_d)\) in some \((m+n-1)\)-dimensional variety \(V \subset K^d\). This variety is determined by a prime ideal \(I_{mn}\) in the ring \(K[c_1, \dots, c_d]\). The ideal \(I_{22}\) is easily computed by hand and the ideal \(I_{32}\) is just within the range of machine computation.
Using Gröbner basis algorithms in MAGMA we find necessary and sufficient conditions for a polynomial of degree 6 over any field to be the tensor product of two polynomials, one of degree 3 and one of degree 2.
MSC:
12E10 | Special polynomials in general fields |
13P10 | Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) |
12Y05 | Computational aspects of field theory and polynomials (MSC2010) |
68W30 | Symbolic computation and algebraic computation |
Citations:
Zbl 0907.20025Software:
MagmaReferences:
[1] | Bosma W., Handbook of MAGMA functions (1993) |
[2] | Cox D., Ideals, varieties, and algorithms,, 2. ed. (1997) |
[3] | Leedham Green C. R., Intemat. J. Algebra Comput. pp 541– (1997) · Zbl 0907.20025 · doi:10.1142/S0218196797000241 |
[4] | Macdonald I. G., Symmetric functions and Hall polynomials,, 2. ed. (1995) · Zbl 0824.05059 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.