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 ...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 Universitythe Basis Scientific Research Fund(200903286)of Ministry of Education of China+1 种基金the NSF(11126044,11071097)of ChinaShandong Postdoctoral Science Foundation(201003054),Innovation Program
文摘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.
