一类整系数多项式在整数环上不可约性的判定

本文通过对整系数多项式系数的讨论，得到了关于一类次数大于五的整系数多项式在整数环上是否可约的一个判别法。     

整数环上的不可约多项式

著名的Eisenstein判别法为寻求整系数不可约多项式提供了方法,但此判别法的三个充分条件具有一定的局限性,致使对相当多的特殊整系数不可约多项式的判断失效.在总结前人研究工作的基础上,推导能有效判断特殊不可约整系数多项式的方法,拓展原有研究结果,可拓宽判断不可约整系数多项式的工具和方法.     

整系数多项式在整数环上不可约性的进一步探讨

本文首先给出了整系数多项式有二次整系数多项式因式的一个必要条件，进而通过对整系数多项式ｆ（ｘ）＝ＡｎＸ２十αｎ－１Ｘｎ－１＋…＋αｏ中ｘｎ－２的系数αｎ－２的讨论，得到一类整系数多项式在整数环上是否可约的一个判别法。     

整多项式可约性的一个判别法

整多项式可约性的一个判别法王琳（中央财院数学教研室）整系数多项式可约性的判定是多项式研究的一个基本问题，也是一个比较困难的问题．在这方面有著名的艾森斯坦因判别法．为论述方便先引人下面记号．设ｆ（ｘ）＝…＋ａ１ｘ＋ａｏ（ａｎ０）为一整系数多项式ｐ是一个...     

关于艾森斯坦因判别法的间接应用

探讨了间接应用艾森斯坦因判别法判断整系数多项式在有理数域上不可约的两种途径.     

对“Eisenstein判别法的应用（2）”一文中所承认的一个结论的商榷

在整系数不可约多项式中,有一类不可约多项式f_1(x),它们不能直接应用Eisenstein判别法来判别;一般教科书中都指出,这时可适当选取整数α、β,令x=αy+β,使g(y)=f_1(αy+β)能用Eisenstein判别法来判别。也有另一类不可约多项式(用S来表示这一类多项式)     

关于Eisenstein判别法的一点注记

判断一个整系数多项式在有理数域上不可约,有著名的充分条件—Eisenstein判别法(参见[1]或[2])。由于对整系数多项式f(x)和任意整数b,f(x)与整系数多项式g(y)=f(y+b)在有理数域上同时为可约或不可约,所以在证明f(x)不可约时,如果f(x)不满足     

推广Eisenstein判别法判定整系数多项式有理根的存在性

通过对Eisenstein判别法条件的弱化和强化,得到相关整系数多项式有理根存在性的判定定理.     

再论整数环上多项式的不可约性的判别法

本研究整系数多项式的不可约因式，给出了低次不可约多项式的判别的一种方法和一些不可约问题的处理方法。     

“Eisenstein判别法的应用”一文的注记

文[1]对Eisenstein判别法的应用范围进行了讨论,对二次不可约多项式得到了非常完整的结果。对一般的n次整系数不可约多项式f(x)作变换x=y+k后能否用Eisenstein判别法来判定也作了一些有益的探讨. 文[1]同时提出了疑问,“是否对任何有理     

Remarks on Polynomial Parametrization of Sets of Integer Points

If, for a subset S of ?^k, we compare the conditions of being parametrizable by (a) a single k-tuple of polynomials with integer coefficients, (b) a single k-tuple of integer-valued polynomials, and (c) finitely many k-tuples of polynomials with integer coefficients (variables ranging through the integers in each case), then a ? b (obviously), b ? c, and neither implication is reversible. Condition (b) is equivalent to S being the set of integer k-tuples in the range of a k-tuple of polynomials with rational coefficients, as the variables range through the integers. Also, we show that every co-finite subset of ?^k is parametrizable a single k-tuple of polynomials with integer coefficients.     

完全找到整系数不可约多项式的一种新方法

本利用一种独特的映射方法将整系数多项式映射为正有理数，运用谊映射方法和数论理论，可以找到任意多个整系数不可约多项式，因此，为扩频通信与信道密码利用不可约多项式提供了一种可行且实用的技术。     

Approximation of Smooth Functions and Constants by Polynomials with Integer and Natural Coefficients

Direct theorems on the approximation of smooth functions by polynomials with integer coefficients are strengthened. First theorems on approximation by polynomials with natural coefficients are obtained.     

一类特殊多项式整数规划问题的最优化算法

本文考虑了一类特殊的多项式整数规划问题。此类问题有很广泛的实际应用,并且是NP难问题。对于这类问题,最优性必要条件和最优性充分条件已经给出。我们在本文中将要利用这些最优性条件设计最优化算法。首 先,利用最优性必要条件,我们给出了一种新的局部优化算法。进而我们结合最优性充分条件、新的局部优化算法和辅助函数,设计了新的全局最优化算法。本文给出的算例展示出我们的算法是有效的和可靠的。     

Integer version of the multipath flow network synthesis problem

We consider the following integer multipath flow network synthesis problem. We are given two positive integers q, n, (1<q<n), and a non-negative, integer, symmetric, n×n matrix R, each non-diagonal element r_ij of which represents the minimum requirement of q-path flow value between nodes i and j in an undirected network on the node set N={1,2,…,n}. We want to construct a simple, undirected network G=[N,E] with integer edge capacities {u_e:e∈E} such that each of these flow requirements can be realized (one at a time) and the sum of all the edge capacities is minimum. We present an O(n³) combinatorial algorithm for the problem and we show that the problem has integer rounding property.     

A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems

In this paper, a computational algorithm, named RST2ANU algorithm, has been developed for solving integer and mixed integer global optimization problems. This algorithm, which primarily is based on the original controlled random search approach of Price [22i], incorporates a simulated annealing type acceptance criterion in its working so that not only downhill moves but also occasional uphill moves can be accepted. In its working it employs a special truncation procedure which not only ensures that the integer restrictions imposed on the decision variables are satisfied, but also creates greater possibilities for the search leading to a global optimal solution. The reliability and efficiency of the proposed RST2ANU algorithm has been demonstrated on thirty integer and mixed integer optimization problems taken from the literature. The performance of the algorithm has been compared with the performance of the corresponding purely controlled random search based algorithm as well as the standard simulated annealing algorithm. The performance of the method on mathematical models of three realistic problems has also been demonstrated.     

计算幂和多项式的矩阵方法

利用矩阵给出了计算幂和多项式的统一方法.     

关于不定方程x~2-Dy~2=c的最小正整数解

给出一般二元二次不定方程最小正整数解的一个判定准则 ,确定了几类二元二次不定方程和Pell方程的最小正整数解 ,推广了 [1 ]、[2 ]中的两个结果