替换定理一些问题的讨论

本给出了替换定理的一种新的证法，此证法直观易懂。     

关于解析函数的一个易想象的不等式及其应用

本文关于解析函数给出了一个可作几何理解的不等式,由此易得出一个有关解析函数零点的命题,而代数学基本定理成为它的直接推论．     

TL-subrings and TL-ideals,Part3:Maximal TL-ideals and ireducible TL-ideals

ＴＬｓｕｂｒｉｎｇｓａｎｄＴＬｉｄｅａｌｓ，Ｐａｒｔ３：ＭａｘｉｍａｌＴＬｉｄｅａｌｓａｎｄｉｒｅｄｕｃｉｂｌｅＴＬｉｄｅａｌｓＹｕＹａｎｄｏｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＹａｎｃｈｅｎｇＴｅａｃｈｅｒｓＣｏｌｅｇｅ...     

A Geodesic Between the Hilbert Basis Theorem and Gordan''''s Lemma

Gordan's Lemma and Hilbert Basis theorem, both merging from establishing thefinite generation of invariants, are proved in one combinatorial set up, namely, thesemigroup N~n     

Multiplicative Maps With Specified (1, 1)-Entry

In this article, we will show that for many complex-valued maps f over a semigroup G of matrices, there exists a minimum k for the existence of a multiplicative map for which the (1, 1)-entry of ϕ( A ) is f ( A ). We obtain results on such multiplicative maps, and use them to classify all the multiplicative maps τon G such that f ( A ) = τ( g ( A )) for any A ε G , where f and g are given complex-valued maps.     

利用原子吸收技术(FAAS)对聚苯胺酚树脂除铁性能进行评价

采用铁的次灵敏线，利用火焰原子吸收分光光度法对聚苯胺酚树脂的除铁性能进行测试，其对高含量铁的测试结果与化学滴定法比较相一致，但操作简便、快速。     

LFI代数的性质及其与剩余格的关系

讨论LFI代数的性质．也讨论具有可嵌入性的LFI代数的性质；还给出了定义在完备格上的LFI代数成为剩余格的充要条件。     

Bernoulli多项式与Euler—Maclaurin公式的推广

本文提出了广义Bernoulli多项式与广义Bernoulli数,并借此得到了一类含两端点连续阶导数值求积公式的误差渐近式和推广的Euler-Maclaurin求和公式.借助于计算机代数系统进行了公式的机械推导,并列出了部分推导结果.     

On a class of subalgebras of and the intersection of their free maximal ideals

Let be a Tychonoff space and a subalgebra of containing . Suppose that is the set of all functions in with compact support. Kohls has shown that is precisely the intersection of all the free ideals in or in . In this paper we have proved the validity of this result for the algebra . Gillman and Jerison have proved that for a realcompact space , is the intersection of all the free maximal ideals in . In this paper we have proved that this result does not hold for the algebra , in general. However we have furnished a characterisation of the elements that belong to all the free maximal ideals in . The paper terminates by showing that for any realcompact space , there exists in some sense a minimal algebra for which becomes -compact. This answers a question raised by Redlin and Watson in 1987. But it is still unsettled whether such a minimal algebra exists with respect to set inclusion.

     

Powers of matrices over an extremal algebra with applications to periodic graphs

Consider the extremal algebra=({},min,+), using + and min instead of addition and multiplication. This extremal algebra has been successfully applied to a lot of scheduling problems. In this paper the behavior of the powers of a matrix over is studied. The main result is a representation of the complete sequence (A ^m ) _m which can be computed within polynomial time complexity. In the second part we apply this result to compute a minimum cost path in a 1-dimensional periodic graph.