摘要
In this paper, we improve the algorithm and rewrite the function make- Pairing for computing a Gorni-Zampieri pair of a homogeneous polynomial map. As an application, some counterexamples to PLDP (dependence problem for power lin- car maps) are obtained, including one in the lowest dimension (n = 48) in all suchcounterexamples one has found up to now.
In this paper, we improve the algorithm and rewrite the function make- Pairing for computing a Gorni-Zampieri pair of a homogeneous polynomial map. As an application, some counterexamples to PLDP (dependence problem for power lin- car maps) are obtained, including one in the lowest dimension (n = 48) in all suchcounterexamples one has found up to now.
基金
The"985 Project"and"211 Project"of Jilin University
the Basis Scientific Research Fund(200903286)of Ministry of Education of China
the NSF(11126044,11071097)of China
Shandong Postdoctoral Science Foundation(201003054),Innovation Program