We extend the concept of the resolvent of a prime ideal to the concept of theresolvent of a general ideal with respect to a set of parameters and propose an algorithmto construct the generalized resolvents based on Wu...We extend the concept of the resolvent of a prime ideal to the concept of theresolvent of a general ideal with respect to a set of parameters and propose an algorithmto construct the generalized resolvents based on Wu-Rits’s zero decomposition algorithm.Our generalized algorithm has the following applications. (1) For a reducible variety V,we can find a direction on which V is projected birationally to an irreducible hypersurface.(2) We give a new algorithm to find a primitive element for a finite algebraic extensionof a field of characteristic zero. (3) We present a complete method of finding parametricequations for algebraic curves. (4) We give a method of solving a system of polynomialequations to any given precision.展开更多
Let q be a prime or prime power and Fq^n the extension of q elements finite field Fq with degree n （n 〉 1）. Davenport, Lenstra and School proved that there exists a primitive element α ∈ Fq^n such that α generat...Let q be a prime or prime power and Fq^n the extension of q elements finite field Fq with degree n （n 〉 1）. Davenport, Lenstra and School proved that there exists a primitive element α ∈ Fq^n such that α generates a normal basis of Fq^n over Fq. Later, Mullin, Gao and Lenstra, etc., raised the definition of optimal normal bases and constructed such bases. In this paper, we determine all primitive type I optimal normal bases and all finite fields in which there exists a pair of reciprocal elements α and α^-1 such that both of them generate optimal normal bases of Fq^n over Fq. Furthermore, we obtain a sufficient condition for the existence of primitive type II optimal normal bases over finite fields and prove that all primitive optimal normal elements are conjugate to each other.展开更多
In [5, 6] the relationships between test words, generic elements, almost primitivity and tame almost primitivity were examined in free groups. In this paper we extend the concepts and connections to general free produ...In [5, 6] the relationships between test words, generic elements, almost primitivity and tame almost primitivity were examined in free groups. In this paper we extend the concepts and connections to general free products and in particular to free products of cyclic groups.展开更多
Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-...Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-1)-flat is associated with a point in PG(m-1, sn). An orthogonal array Lsmn((sn)(smn-)(sn-1) can be constructed by using (smn-1)/( sn-1) points in PG(m-1, sn). A set of (st-1)/(s-1) points in PG(m-1, sn) is called a (t-1)-flat over GF(s) if it is isomorphic to PG(t-1, s). If there exists a (t-1)-flat over GF(s) in PG(m-1, sn), then we can replace the corresponding [(st-1)/(s-1)] sn-level columns in Lsmn((sn)(smn-)(sn-1) by (smn-1)/( sn-1) st -level columns and obtain a mixed orthogonal array. Many new mixed orthogonal arrays can be obtained by this procedure. In this paper, we study methods for finding disjoint (t-1)-flats over GF(s) in PG(m-1, sn) in order to construct more mixed orthogonal arrays of strength two. In particular, if m and n are relatively prime then we can construct an Lsmn((sm)smn-1/sm-1-i(sn-1)/ (s-1)( sn) i(sm-1)/ s-1) for any 0i(smn-1)(s-1)/( sm-1)( sn-1) New orthogonal arrays of sizes 256, 512, and 1024 are obtained by using PG(7,2), PG(8,2), and PG(9,2) respectively.展开更多
文摘We extend the concept of the resolvent of a prime ideal to the concept of theresolvent of a general ideal with respect to a set of parameters and propose an algorithmto construct the generalized resolvents based on Wu-Rits’s zero decomposition algorithm.Our generalized algorithm has the following applications. (1) For a reducible variety V,we can find a direction on which V is projected birationally to an irreducible hypersurface.(2) We give a new algorithm to find a primitive element for a finite algebraic extensionof a field of characteristic zero. (3) We present a complete method of finding parametricequations for algebraic curves. (4) We give a method of solving a system of polynomialequations to any given precision.
基金Supported by the National Natural Science Foundation of China (Grant No10990011)Special Research Found for the Doctoral Program Issues New Teachers of Higher Education (Grant No20095134120001)the Found of Sichuan Province (Grant No09ZA087)
文摘Let q be a prime or prime power and Fq^n the extension of q elements finite field Fq with degree n （n 〉 1）. Davenport, Lenstra and School proved that there exists a primitive element α ∈ Fq^n such that α generates a normal basis of Fq^n over Fq. Later, Mullin, Gao and Lenstra, etc., raised the definition of optimal normal bases and constructed such bases. In this paper, we determine all primitive type I optimal normal bases and all finite fields in which there exists a pair of reciprocal elements α and α^-1 such that both of them generate optimal normal bases of Fq^n over Fq. Furthermore, we obtain a sufficient condition for the existence of primitive type II optimal normal bases over finite fields and prove that all primitive optimal normal elements are conjugate to each other.
文摘In [5, 6] the relationships between test words, generic elements, almost primitivity and tame almost primitivity were examined in free groups. In this paper we extend the concepts and connections to general free products and in particular to free products of cyclic groups.
文摘Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-1)-flat is associated with a point in PG(m-1, sn). An orthogonal array Lsmn((sn)(smn-)(sn-1) can be constructed by using (smn-1)/( sn-1) points in PG(m-1, sn). A set of (st-1)/(s-1) points in PG(m-1, sn) is called a (t-1)-flat over GF(s) if it is isomorphic to PG(t-1, s). If there exists a (t-1)-flat over GF(s) in PG(m-1, sn), then we can replace the corresponding [(st-1)/(s-1)] sn-level columns in Lsmn((sn)(smn-)(sn-1) by (smn-1)/( sn-1) st -level columns and obtain a mixed orthogonal array. Many new mixed orthogonal arrays can be obtained by this procedure. In this paper, we study methods for finding disjoint (t-1)-flats over GF(s) in PG(m-1, sn) in order to construct more mixed orthogonal arrays of strength two. In particular, if m and n are relatively prime then we can construct an Lsmn((sm)smn-1/sm-1-i(sn-1)/ (s-1)( sn) i(sm-1)/ s-1) for any 0i(smn-1)(s-1)/( sm-1)( sn-1) New orthogonal arrays of sizes 256, 512, and 1024 are obtained by using PG(7,2), PG(8,2), and PG(9,2) respectively.
