On Generating Discrete Orthogonal Bivariate Polynomials

In this paper we present an algorithm for recursively generating orthogonal bivariate polynomials on a discrete set S ². For this purpose we employ commuting pairs of real symmetric matrices H, K ^n×n to obtain, in a certain sense, a two dimensional Hermitian Lanczos method. The resulting algorithm relies on a recurrence having a slowly growing length. Practical implementation issues an applications are considered. The method can be generalized to compute orthogonal polynomials depending on an arbitrary number of variables.     

Commutativity of rings with polynomial constraints

Let p, q and r be fixed non-negative integers. In this note, it is shown that if R is left (right) s-unital ring satisfying , respectively) where , then R is commutative. Moreover, commutativity of R is also obtained under different sets of constraints on integral exponents. Also, we provide some counterexamples which show that the hypotheses are not altogether superfluous. Thus, many well-known commutativity theorems become corollaries of our results.     

Computation of generalized real radicals of polynomial ideals

For an ordered field (K,T) and an idealI of the polynomial ring , the construction of the generalized real radical ofI is investigated. When (K,T) satisfies some computational requirements, a method of computing is presented. Project supported by the National Natural Science Foundation of China (Grant No. 19661002) and the Climbing Project.     

En">Characters and Composition Factor Multiplicities for the Lie Superalgebra $${\mathfrak{g}}{\mathfrak{l}}$$ ( m / n )

The multiplicities a of simple modules L in the composition series of Kac modules V lambda for the Lie superalgebra (m/n ) were described by Serganova, leading to her solution of the character problem for (m/n ). In Serganova's algorithm all with nonzero a are determined for a given this algorithm, turns out to be rather complicated. In this Letter, a simple rule is conjectured to find all nonzero a for any given weight . In particular, we claim that for an r-fold atypical weight there are 2r distinct weights such that a = 1, and a = 0 for all other weights . Some related properties on the multiplicities a are proved, and arguments in favour of our main conjecture are given. Finally, an extension of the conjecture describing the inverse of the matrix of Kazhdan–Lusztig polynomials is discussed.     

On the division of polynomial matrices

The main purpose of this paper is to determine two new algorithmsfor the division of the polynomial matrix B(s) R[s]^pxq by A(s) R[s]^pxp (a) based on the Laurent matrix expansion at s = =of the inverse of A(s), i.e. A(s)^–1, and (b) in a waysimilar to the one presented by Gantmacher (1959).     

Hypergeometric Polynomials and Integer Programming

We examine connections between A-hypergeometric differential equations and the theory of integer programming. In the first part, we develop a hypergeometric sensitivity analysis for small variations of constraint constants with creation operators and b-functions. In the second part, we study the indicial polynomial (b-function) along the hyperplane xi=0 via a correspondence between the optimal value of an integer programming problem and the roots of the indicial polynomial. Gröbner bases are used to prove theorems and give counter examples.     

平面多项式系统及其相伴系统

引进平面多项式系统的相伴系统的概念 ,分析了多项式系统与其相伴系统之间在极限环不存在性 ,唯一性 ,中心焦点的判定等问题上的相似之处和不同之处 ,提出了几个公开问题 .     

A generalized Dedekind-Mertens lemma and its converse

We study content ideals of polynomials and their behavior under multiplication. We give a generalization of the Lemma of Dedekind-Mertens and prove the converse under suitable dimensionality restrictions.

     

涉及微分多项式的亚纯函数的唯一性

设ｆ（ｚ）是非常数的整函数，ｎ是正整数，Ｆ（ｚ）＝ｆ￣（ｎ）（ｚ）＋ａ＿１（ｚ）ｆ￣（ｎ－１）（ｚ）＋…＋ａ＿ｎ（ｚ）ｆ（ｘ），其中ａ＿１（ｚ），ａ＿２（ｚ），…，ａ＿ｎ（ｚ）均是ｆ（ｚ）的小函数，本文证明了：若ｆ（ｚ）和Ｆ（ｚ）几乎ＣＭ分担两个不同的有穷复数ａ和ｂ，则ｆ（ｚ）≡Ｆ（ｚ）．