This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye, Dai, and Lam （1999） ...This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye, Dai, and Lam （1999） and were developed by Faugere, Perret （2006, 2008, 2009）. The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homoge- nous polynomials can be computed using the algorithm with high probability. This solves a conjecture proposed by Ye, Dal, and Lam （1999）. The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials. Finally, the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.展开更多
By means of a method of analytic number theory the following theorem is proved. Letp be a quasi-homogeneous linear partial differential operator with degreem,m > 0, w.r.t a dilation $\left\{ {\delta _\tau } \right\...By means of a method of analytic number theory the following theorem is proved. Letp be a quasi-homogeneous linear partial differential operator with degreem,m > 0, w.r.t a dilation $\left\{ {\delta _\tau } \right\}{\text{ }}_{\tau< 0} $ given by ( a1, …, an). Assume that either a1, …, an are positive rational numbers or $m{\text{ = }}\sum\limits_{j = 1}^n {\alpha _j \alpha _j } $ for some $\alpha {\text{ = }}\left( {\alpha _1 ,{\text{ }} \ldots {\text{ }},\alpha _n } \right) \in l _ + ^n $ Then the dimension of the space of polynomial solutions of the equationp[u] = 0 on ?n must be infinite展开更多
基金partially supported by a National Key Basic Research Project of China under Grant No. 2011CB302400by a Grant from NSFC with Nos 60821002 and 10901156
文摘This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye, Dai, and Lam （1999） and were developed by Faugere, Perret （2006, 2008, 2009）. The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homoge- nous polynomials can be computed using the algorithm with high probability. This solves a conjecture proposed by Ye, Dal, and Lam （1999）. The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials. Finally, the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.
基金the National Natural Science Foundation of China (Grnat No. 19971068) .
文摘By means of a method of analytic number theory the following theorem is proved. Letp be a quasi-homogeneous linear partial differential operator with degreem,m > 0, w.r.t a dilation $\left\{ {\delta _\tau } \right\}{\text{ }}_{\tau< 0} $ given by ( a1, …, an). Assume that either a1, …, an are positive rational numbers or $m{\text{ = }}\sum\limits_{j = 1}^n {\alpha _j \alpha _j } $ for some $\alpha {\text{ = }}\left( {\alpha _1 ,{\text{ }} \ldots {\text{ }},\alpha _n } \right) \in l _ + ^n $ Then the dimension of the space of polynomial solutions of the equationp[u] = 0 on ?n must be infinite
