第八届全国计算机数学学术会议,第一届全国计算机数学学术会议 报告摘要

摘要：

Let F be a polynomial set in Q[x1,K, xm ], we can decompose F into a series of ascending chain { Ai } given by polynomials irreducible over Q first. Then to get irreducible decomposition, we must decompose every Ai into irreducible ascending chains. Let A = {P1,K, Pn} be an ascending chain with yi be the leading variable of Pi , the other variables will be denoted by u1,K,us , so s+n=m. Let K = Q(u1,K,us ) , then A is zero-dimensional ascending chain over K. Let d be the number of solutions of A. Substitute y1 = y + a2 y2 + Kan yn into A. We prove that among (Cd2 )n-1 integral vectors (a2,K, an ) in (n-1)-cube [b1, b1 + Cd2 - 1] x [b2, b2 + Cd2 - 1] xK x [bn , bn + Cd2 - 1] with bi integer, there must be

展开