Z|(pe)上多项式分裂环及线性递归序列根表示

在引进环Z/(P^e)上多项式的分裂环概念基础上,讨论了多项式分解和根的性质,利用这些性质和序列簇的结构,给出了Z/(P^e)上线性递归序列的根表示,并证明这种表示完全由序列唯一确定。     

多项式时间度的极小对分裂

本文讨论多项式时间度的极小对分裂问题．证明了尽管有些非零多项式时间度不能分裂成极小对，但是任何非零的多项式时间度都可分裂成两个或两个以上的极小对之并的形式，也可分裂成一个多项式时间度与一组两两互成极小对的多项式时间度之并的形式．本文构造了Ｃ￣ｎ中单位球Ｂ￣ｎ和多圆盘△￣ｎ的（０，１）型热核形式，作为应用，我们给出了多圆盘上方程解的积分表示．     

广义线性McCoy环

称环R是右线性McCoy的,如果R[x]中非零线性多项式f（x）,g（x）满足I（x）g（x）=0,则存在非零元素r∈R使得f（x）r=0．设a是环R的自同态,通过用斜多项式环R[x;a]中的元素代替一般多项式环R[x]中的元素而引入a-线性McCoy环的概念．讨论了a-线性McCoy环的基本性质和扩张性质．     

多项式分裂可行问题

本文研究多项式分裂可行问题,即由多项式不等式定义的分裂可行问题,包括凸与非凸、可行与不可行的问题;给出多项式分裂可行问题解集的半定松弛表示;研究其半定松弛化问题的性质;并基于这些性质建立求解多项式分裂可行问题的半定松弛算法.本文在较为一般的条件下证明了,如果分裂可行问题有解,则可通过本文建立的算法求得一个解点;如果问题无解,则该算法能够判别问题不可行.最后通过数值实验对算法进行验证.     

多项多矩阵代数性质讨论

本利用系统与控制论中有关多项式矩阵的结果，对我项工矩阵代数性质进行讨论，得到的主要结果有多项式方阵环是主理想环，也是主单侧理想环。     

多项式环上的投射模

本文证明了：如果R为交换的w-遗传环，则有限生成的投射R[x1…xn]-模能够从R扩张，进而系统研究了非Noether环上多项式环上的模结构．     

AT-free图的配对控制集算法

本文给出了配对控制集在AT-free图的BFS-树上分布的结构性质．利用这些性质，我们给出了求解AT-free图类最小配对控制集的多项式时间算法．     

一个新的多项式不可约判定定理

一个新的多项式不可约判定定理梅汉飞，龙占洪（湖南常德师专４１５０００）（湖南常德市五中）本文利用复数性质深化了Ｂｒｏｗ，Ｇｒａｈａ判定定理［１］，使其有更广的应用范围．约定Ｑ为有理数域，Ｚ为整数环，表示ｘ的共轭数，表示集Ａ的元素个数．表示多项式ｖ（ｘ...     

McCoy环的Ore扩张(英文)

本文研究了斜多项式环与微分多项式环的McCoy性质,证明了如果环R是α-compatible和可逆的,那么斜多项式R[x;α]是McCoy环当且仅当环R是McCoy环;同时我们也证明了如果环R是δ-compatible与可逆的,那么微分多项式环R[x;δ]是McCoy环当且仅当环R是McCoy环.因此本文对McCoy环的相关结论进行了推广.     

对称环的扩张

本文首先考虑了对称环的性质和基本的扩张．其次讨论了几种多项式环的对称性,且证明了:如果R是约化环,则R[x]／(xn)是对称环,其中(xn)是由xn生成的理想,n是一个正整数．最后证明了:对一个右Ore环R,R是对称环当且仅当R的古典右商环Q是对称环．     

Quantum integer-valued polynomials

We define a q-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity properties: For instance, the structure constants for this ring with respect to its basis of q-binomial coefficient polynomials belong to \(\mathbb {N}[q]\). We then classify all maps from this ring into a field, extending a known classification in the classical case where \(q=1\).     

Extended nilHecke algebras and symmetric functions in type B

We formulate a type B extended nilHecke algebra, following the type A construction of Naisse and Vaz. We describe an action of this algebra on extended polynomials and describe some results on the structure on the extended symmetric polynomials. Finally, following Appel, Egilmez, Hogancamp, and Lauda, we prove a result analogous to a classical theorem of Solomon connecting the extended symmetric polynomial ring to a ring of usual symmetric polynomials and their differentials.     

On Polynomials Over Rickart Rings and Their Generalizations I

This paper continues the investigation of polynomials and formal power series over a ring with various annihilator conditions which were originally used by Rickart and Kaplansky to abstract the algebraic properties of von Neumann algebras. Results of Armendariz on polynomial rings over a PP ring are extended to analogous annihilator conditions in nearrings of polynomials and nearrings of formal power series. These results are somewhat striking since, in contrast to the polynomial ring case, the nearring of polynomials or formal power series has substitution for its “multiplication” operation. These investigations provide an alternative viewpoint in illustrating the structure of polynomials and formal power series. Extensions of Rickart rings to formal power series rings are also discussed. The author was partially supported by the National Science Council, Taiwan under the grant number NSC 93-2115-M-143-001.     

A family of cyclic cubic polynomials whose roots are systems of fundamental units

We give a family of cyclic cubic polynomials whose roots are systems of fundamental units of the splitting fields. These polynomials are constructed by a linear fractional transformation from Shanks’ polynomials with rational coefficients.     

Duality and deformations of stable Grothendieck polynomials

Stable Grothendieck polynomials can be viewed as a K-theory analog of Schur polynomials. We extend stable Grothendieck polynomials to a two-parameter version, which we call canonical stable Grothendieck functions. These functions have the same structure constants (with scaling) as stable Grothendieck polynomials and (composing with parameter switching) are self-dual under the standard involutive ring automorphism. We study various properties of these functions, including combinatorial formulas, Schur expansions, Jacobi–Trudi-type identities, and associated Fomin–Greene operators.     

On Decomposition of Algebraic PDE Systems into Simple Subsystems

In this paper we present an algorithmization of the Thomas method for splitting a system of partial differential equations and (possibly) inequalities into triangular subsystems whose Thomas called simple. The splitting algorithm is applicable to systems whose elements are differential polynomials in unknown functions and polynomials in independent variables. Simplicity properties of the subsystems make easier their completion to involution. Our algorithmization uses algebraic Gröbner bases to avoid some unnecessary splittings.     

Sequences of functions of binomial type

The theory of binomial enumeration leads to sequences of functions of binomial type which are not polynomials. The results of Mullin-Rota for these sequences are developed and a ring structure on the set of sequences is studied.     

PARALLEL ITERATION FOR SPLITTING FACTORS OF POLYNOMIALS

In this paper we consider some parallel iterations for splitting quadratic factors of polynomials and their convergence.     

Genus polynomials and crosscap‐number polynomials for ring‐like graphs

An H‐linear graph is obtained by transforming a collection of copies of a fixed graph H into a chain. An H‐ring‐like graph is formed by binding the two end‐copies of H in such a chain to each other. Genus polynomials have been calculated for bindings of several kinds. In this paper, we substantially generalize the rules for constructing sequences of H‐ring‐like graphs from sequences of H‐linear graphs, and we give a general method for obtaining a recursion for the genus polynomials of the graphs in a sequence of ring‐like graphs. We use Chebyshev polynomials to obtain explicit formulas for the genus polynomials of several such sequences. We also give methods for obtaining recursions for partial genus polynomials and for crosscap‐number polynomials of a bar‐ring of a sequence of disjoint graphs.     

Application of the Galerkin method to the formulation of a three-dimensional nonlinear hydrodynamic numerical sea model

A mathematical formulation is presented for solving the three-dimensional nonlinear hydrodynamic equations, using the Galerkin method with an arbitrary set of basis functions.An explicit time splitting method is used to integrate these equations through time. The time splitting method is formulated in such a way that the advective terms, which are computationally expensive to evaluate, are integrated with a longer time step than the linear terms. The length of the time step used to integrate the linear terms is determined by the propagation speed of the gravity waves. The paper demonstrates that using this time splitting method an accurate and computationally economic solution of the full three-dimensional equations is possible.Numerical results are presented for the nonlinear seiche motion in a one-dimensional basin, and for the three-dimensional wind induced flow in a closed rectangular basin, using basis sets of cosine functions, Chebyshev polynomials and Gram-Schmidt orthogonalized polynomials.