利用复数的性质^-zz=｜z｜^2解高考题

教材中关于共轭复数的性质有下面一条：一对共轭复数z，^-z的乘积是一个实数，且这个实数等于每一个复数的模的平方，即^-zz=|z|^2=|^-z|^2，这一性质可以实现复数乘法与复数模之间的转换．运用这种转换，可以使解题过程更为简捷、新颖．本文以高考试题为例，谈其四种应用，以供参考．     

几个三角模的构造定理

本文给出了一个如何由已知三角模构造新的三角模的定理，同时还分别给出了直接构造Ｔ模、Ｓ模的两种方法．     

利用微机计算古典数论问题

判断一个大的整数是否素数，如果它不是素数的话又如何将它分解为若干个因数的乘积是古典数论的一个重要问题．由于计算机科学和密码学的发展，上述的古典问题又焕发出了新的光亮．因为有一种很简单的密码是用素数模乘法变换来构造的．如果你不知道这个素数，你就无法解开这个密码．有人甚至将这个密码的钥匙半公开：一般是把两个素数乘起来产生一个合数．因为这个数很大，如果你不会分解它你是无法解开这个密码的．而制造这个密码的人就需要记住合数分解的方法，密码随时可以解开。     

特征0无穷维单Novikov代数的非奇异模

本文证明了每一个A-模是一个平凡模和一个非奇异模的直和;给出了两类特征0无穷维单Novikov代数的非奇异模的结构定理.     

使用相关内射性对拟连续模的一个刻划

近二十年，许多环与模工作对拟投射模与拟内射模作了各种推广与研究。连续模与拟连续模就是拟内射模的一种推广，拟连续模要比连续模弱。在[2]，作对连续模与拟连续模做了深入的研究。在这篇章中，利用相关内射性给出了拟连续模的一个刻划。     

阿基米德统一模

给出了阿基米德统一模的定义,证明了阿基米德统一模等价于严格统一模,及其生成元之间至多相差一个正乘积因子.     

Koszul代数的Hochschild上同调环

基于Buchweitz等人对Koszul代数的Hochschild上同调环的乘法结构的细致分析,给出了Koszul代数的Hochschild上同调环的乘法本质上是平行路的毗连的一个充要条件,并由此重新证明了二次三角string代数的Hochschild上同调环的乘法是平凡的,从而改进了Bustamante的证明.     

几个三角模的构造定理

本给出了一个如何由已知三角模构造新的三角模的定理，同时还分别给出了直接构造了T模、S模的两种方法。     

左(右)零模

为了更好地描述信息的聚合,左（右）零模的概念被引入。然后,各种连续的左（右）零模的结构定理被给出,即给出了一个二元运算是连续的左（右）零模的充要条件。     

弱T-代数上Caenepeel-Militaru-Zhu定理(英文)

本文介绍了弱T-代数的概念并讨论了它的一些性质,同时给出了弱Yetter-Drinfeld群模的一个充分必要条件,并且证明了弱Yetter-Drinfeld群模事实上是一种弱Doi-Hopf群模.这些结果推广了由Caenepeel-Militaru-Zhu(1997)给出的定理.     

Multiplication Modules and a Theorem of P. F. Smith

P. F. Smith [7, Theorem 8] gave sufficient conditions on a finite set of modules for their sum and intersection to be multiplication modules. We give sufficient conditions on an arbitrary set of multiplication modules for the intersection to be a multiplication module. We generalize Smith"s theorem, and we prove conditions on sums and intersections of sets of modules sufficient for them to be multiplication modules. This revised version was published online in June 2006 with corrections to the Cover Date.     

On finitely generated multiplication modules

We shall prove that if M is a finitely generated multiplication module and Ann(M) is a finitely generated ideal of R, then there exists a distributive lattice M such that Spec(M) with Zariski topology is homeomorphic to Spec(M) to Stone topology. Finally we shall give a characterization of finitely generated multiplication R-modules M such that Ann(M) is a finitely generated ideal of R.     

On the Prime Spectrum of X-Injective Modules

Let R be a commutative ring and M an R-module. The purpose of this article is to introduce a new class of modules over R called X-injective R-modules, where X is the prime spectrum of M. This class contains the family of top modules and that of weak multiplication modules properly. In this article our concern is to extend the properties of multiplication, weak multiplication, and top modules to this new class of modules. Furthermore, for a top module M, we study some conditions under which the prime spectrum of M is a spectral space for its Zariski topology.     

Fock空间上的乘法算子

Fock空间是由整函数组成的具有再生核的Hilbert空间.Fock空间上的乘法算子的定义域不是整个Fock空间,它在Fock空间上是稠定的.研究了Fock空间上的乘法算子的性质,对其值域进行了刻画,并得出了乘法算子作用在Fock空间的拟不变子空间上值域余一维的充要条件.     

Idempotent and Nilpotent Submodules of Multiplication Modules

All rings are commutative with identity, and all modules are unital. The purpose of this article is to investigate multiplication von Neumann regular modules. For this reason we introduce the concept of nilpotent submodules generalizing nilpotent ideals and then prove that a faithful multiplication module is von Neumann regular if and only if it has no nonzero nilpotent elements and its Krull dimension is zero. We also give a new characterization for the radical of a submodule of a multiplication module and show in particular that the radical of any submodule of a Noetherian multiplication module is a finite intersection of prime submodules.     

Bloch空间上紧的乘积算子

本文研究了Bloch函数空间上紧乘积算子，引入了消失α-Caleson测度，利用它给出Bloch空间和小Bloch空间上的乘积算子Mφf=φf紧性的一个充分条件。     

Montgomery Multiplication in GF(2k)

We show that the multiplication operation c=a · b · r^-1 in the field GF(2^k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2^k. The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large.     

Weak Multiplication Modules

In this paper we characterize weak multiplication modules.     

Sur la hauteur de Faltings des variétés abéliennes à multiplication complexe

Motivated by a result of Bost, we use the relationship between Faltings' heights of abelian varieties with complex multiplication and logarithmic derivatives of Artin L-functions at s=0 to investigate these heights. In particular, we prove that the height of an elliptic curve with complex multiplication by Q-d is bounded from below by an effective affine function of log d.     

Forcing Linearity Numbers for Multiplication Modules

In this article, we prove that for any multiplication module M, the forcing linearity number of M, fln(M), belongs to {0,1,2}, and if M is finitely generated whose annihilator is contained in only finitely many maximal ideals, then fln(M) = 0. Also, the forcing linearity numbers of multiplication modules over some special rings are given. We also show that every multiplication module is semi-endomorphal.