多项式剩余类环上循环码新的表示

在编码理论中，多项式剩余类环是非常有意义的，它已经用来构造最优频率希望序列。本文，定义了多项式剩余类环上循环码的离散傅立叶变换及Mattson-Solomon（MS）多项式，证明了多项式剩余类环上的循环码同构于多项式剩余类环的Galois扩张的理想。     

Bounds in Polynomial Rings over Artinian Local Rings

Let R be a (mixed characteristic) Artinian local ring of length l and let X be an n-tuple of variables. We prove that several algebraic constructions in the ring R[X] admit uniform bounds on the degrees of their output in terms of l, n and the degrees of the input. For instance, if I is an ideal in R[X] generated by polynomials g _i of degree at most d and if f is a polynomial of degree at most d belonging to I, then f = q ₁ f ₁ + ··· + q _s f _s , for some q _i of degree bounded in terms of d, l and n only. Similarly, the module of syzygies of I is generated by tuples all of whose entries have degree bounded in terms of d, l and n only.     

Polynomial Rings over Non-noetherian Power Series Rings

ＰｏｌｙｎｏｍｉａｌＲｉｎｇｓｏｖｅｒＮｏｎ┐ｎｏｅｔｈｅｒｉａｎＰｏｗｅｒＳｅｒｉｅｓＲｉｎｇｓＣｈｅｎＨｕａｎｙｉｎ（陈焕艮）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＨｕｎａｎＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｃｈａｎｇｓｈａ，４１００...     

Bounds in Polynomial Rings over Artinian Local Rings

Let R be a (mixed characteristic) Artinian local ring of length l and let X be an n-tuple of variables. We prove that several algebraic constructions in the ring R[X] admit uniform bounds on the degrees of their output in terms of l, n and the degrees of the input. For instance, if I is an ideal in R[X] generated by polynomials g _i of degree at most d and if f is a polynomial of degree at most d belonging to I, then f = q ₁ f ₁ + ··· + q _s f _s , for some q _i of degree bounded in terms of d, l and n only. Similarly, the module of syzygies of I is generated by tuples all of whose entries have degree bounded in terms of d, l and n only.     

On Unimodular Rows over Polynomial Rings

Let A be a commutative ring and n 3 a positive integer. In this paper, we consider unimodular rows (f₁(x),..., f_n(x)) over A[x]. We prove that, if the row of the leading coefficients of f_i(x) is unimodular over A and a A, then there exists E_n(A[x]) such that (f₁(x),...,f_n(x)) = (f₁(a),...,f_n(a)). Also, if A is a Noetherian ring with finite Krull dimension and the row of leading coefficients satisfies the same condition, then we give a bound for the length of in terms of elementary transvections.Partially supported by INTAS 93–436EXT and DFG–RFBR grant No. 96–01–00092G.2000 Mathematics Subject Classification: 19A13, 19B14, 13C10, 13B25, 13F20     

Polynomial Rings over Symmetric Rings Need Not Be Symmetric

Let R be a ring with identity. The polynomial ring over R is denoted by R[x] with x its indeterminate. It is shown that polynomial rings over symmetric rings need not be symmetric by an example.     

On Primitive Ideals in Polynomial Rings over Nil Rings

Let R be a nil ring. We prove that primitive ideals in the polynomial ring R[x] in one indeterminate over R are of the form I[x] for some ideals I of R. Presented by S. MontgomeryMathematics Subject Classifications (2000) 16N40, 16N20, 16N60, 16D25.Agata Smoktunowicz: Current address: Institute of Mathematics, Polish Academy of Sciences, 00-956 Warsaw 10, niadeckich 8, P.O. Box 21, Poland.     

Bivariate Polynomial Interpolation over Nonrectangular Meshes

In this paper, by means of a new recursive algorithm of non-tensor-product-typed divided differences, bivariate polynomial interpolation schemes are constructed over nonrectangular meshes firstly, which is converted into the study of scattered data interpolation. And the schemes are different as the number of scattered data is odd and even, respectively. Secondly, the corresponding error estimation is worked out, and an equivalence is obtained between high-order non-tensor-product-typed divided differences and high-order partial derivatives in the case of odd and even interpolating nodes, respectively. Thirdly, several numerical examples illustrate the recursive algorithms valid for the non-tensor-product-typed interpolating polynomials, and disclose that these polynomials change as the order of the interpolating nodes, although the node collection is invariant. Finally, from the aspect of computational complexity, the operation count with the bivariate polynomials presented is smaller than that with radial basis functions.     

On Polynomial Functions over Finite Commutative Rings

Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.     

Z16环上的二次剩余码

本文研究了整数环模16剩余类环Z16上的二次剩余码,讨论了它们的幂等生成元及其扩展码的自对偶性等代数性质,并研究了码长为7的Z16二次剩余码在两种已有的Gray映射下的有趣性质,尤其是确定了它们的Lee重量分布.     

Sidon Basis in Polynomial Rings over Finite Fields

Czechoslovak Mathematical Journal - Let $${\mathbb{F}_q}\left[ t \right]$$ denote the polynomial ring over $${\mathbb{F}_q}$$ , the finite field of q elements. Suppose the characteristic of...     

Closed Polynomials in Polynomial Rings over Unique Factorization Domains

Let R be a UFD, and let M(R, n) be the set of all subalgebras of the form R[f], where f ∈ R[x ₁,…, x _n ]?R. For a polynomial f ∈ R[x ₁,…, x _n ]?R, we prove that R[f] is a maximal element of M(R, n) if and only if it is integrally closed in R[x ₁,…, x _n ] and Q(R)[f] ∩ R[x ₁,…, x _n ] = R[f]. Moreover, we prove that, in the case where the characteristic of R equals zero, R[f] is a maximal element of M(R, n) if and only if there exists an R-derivation on R[x ₁,…, x _n ] whose kernel equals R[f].     

Z2k上的二次剩余码

Hammons利用Gray映射把一些具有良好纠错能力的非线性码与Z4上的线性码建立了联系.本文进-步对更-般的环上的循环码进行研究,我们定义了Z2k上-类特殊的循环码-二次剩余码,证明了它的存在性及个数,并且证明了它与域上的二次剩余码有类似的性质.     

可除的四元数代数上多项式环的Grobner基

设F是一个特征不等于2的域,A是,上的一个可除代数。本文研究了A上多项式环A[x1,X2,…,xn]中理想是有限生成的,以及它的Grobner基;也表明F[x1,x2,…,xn]中有限子集G是F[x1,x2,…,xn]的Griobner基当且仅当G是A[x1,x2,…,xn]中的Grobner基。     

Partial Skew Polynomial Rings and Goldie Rings

We prove that if R is a semiprime ring and α is a partial action of an infinite cyclic group on R, then R is right Goldie if and only if R[x; α] is right Goldie if and only if R?x; α? is right Goldie, where R[x; α] (R?x; α?) denotes the partial skew (Laurent) polynomial ring over R. In addition, R?x; α? is semiprime while R[x; α] is not necessarily semiprime.     

Partial Skew Polynomial Rings and Jacobson Rings

In this article we consider rings R with a partial action α of an infinite cyclic group G on R. We generalize the well-known results about Jacobson rings and strongly Jacobson rings in skew polynomial rings and skew Laurent polynomial rings to partial skew polynomial rings and partial skew Laurent polynomial rings.     

Z／（p^e）上分裂环的结构

本文研究了环ｚ／（ｐｅ）上多项式的性质和分裂环的结构．主要分析了分裂环中元素的极小多项式，零化理想的结构，和分裂环子环性质．     

w-Divisoriality in Polynomial Rings

We characterize all finite p-groups G of order p ⁿ (n ≤ 6), where p is a prime for n ≤ 5 and an odd prime for n = 6, such that the center of the inner automorphism group of G is equal to the group of central automorphisms of G.