PGL_2(q)的轮换母函数与射影直线上的5-设计

M.A.Harrison为了对Boole函数分类而计算了二元域上线性群GL_n(2)的轮换母函数(cycle index)。为了构作射影直线上的t-设计,我们在本文中计算了有限域F_q上一维射影线性群PGL_2(q)的轮换母函数,得到了     

具有特殊协方差结构的 SURE 模型中参数估计的若干结果

本文讨论具有特殊协方差结构似乎不相关回归方程（SURE）模型中参数的估计问题．除非另有说明,损失函数将取为二次损失和矩阵损失．本文证明了回归系数的线性可估函数的最小二乘估计是极小极大的且在矩阵损失函数下是可容许的;还分别在仿射交换群和平移群下导出了存在回归系数的线性可估函数的一致最小风险同变（UMRE）估计的充要条件,并证明了在仿射交换和二次损失下不存在协方差阵和方差的UMRE估计．     

对称群上交换图的完备码

设G是一个有限群,G上的交换图以G中非中心元素构成的集合为顶点集,其中两个不同的顶点x,y相邻当且仅当xy=yx.图的完备码问题是指:判断图是否具有完备码;如果图具有完备码,则如何找到该图的完备码.本文解决了对称群和交错群上交换图的完备码问题.     

相对差集和组合集的构造

利用Galois环、Bent函数、Gaolis环上的部分指数和等技巧,构造了指数不超过4的有限交换群上的分裂型相对差集和一类非分裂型组合集.     

有限交换环上极限线性群的Sylowp—子集

本文给出了有限交换局部环Ｒ上无限线性群ＧＬ（Ｒ）＝∪ｎＧＬｎＲ的Ｓｙｌｏｗｐ－了群的形式。令Ｍ是有限交换局部环Ｒ的唯一极大理想，ｋ＝Ｒ／Ｍ为Ｒ的剩余类域。用ｘ（ｋ）表示ｋ的特征，并假定ｐ与ｘ（ｋ）互素。     

交换环上三角矩阵模间的线性保持映射(英文)

本文研究了交换环上三角矩阵模间的线性保持问题.利用矩阵计算技巧和局部化技巧,刻画了上三角矩阵T_n(R)上分别保持立方幂等,{1}逆,{1,2}逆和群逆的所有R模自同构集合中的元素,其中R是交换环.     

半局部环上二维线性群的构造

<正> B.R.McDonal 在[3]中把研究交换环上二维线性群的结构,特别当2为非单位时,作为以后典型群的一个研究方向而提了出来,并且他指出 N.H.T.Lacrox 的文章[2],局部环上的二维线性群,在当时是2非单位的交换环上二维线性群结构方面的唯一结果.而 N.H.T.Lacrox 在文章[2]中假定2为非单位.本文对剩余域元数个数均大于5的半局环上二维线性群,无论2为单位与否,统一讨论,解决了其结构问题.     

有限交换环上常循环码研究

有限交换环上常循环码在代数编码理论研究中占有重要的地位,特别是在构造有限域上高纠错性能非线性码中有着重要的应用.本文介绍了有限交换环上常循环码的研究进展,阐述了研究有限交换环上常循环码结构的一般方法及相关问题,分析了如何利用等距Gray映射构造有限域上的线性码.     

Galois环和Z/(m)环上完全非线性函数的性质

本文把完全非线性函数推广到了有限Abel群上,利用特征谱讨论了Z/(m)上Bent函数与GF(pe)上bent函数以及完全非线性函数定义之间的关系;给出Galois环与Z/(m)上最佳线性逼近的特征谱表示,得到完全非线性函数在某种程度上能抵抗最佳线性逼近攻击的结论;并给出一种Galois环与Z/(m)环上完全非线性函数的构结方法.     

具有拟不变测度的交换拓扑群上的正定函数

<正> §1.引言如所周知,拓扑群上的正定函数是研究拓扑群的酉表示的重要工具.对于交换的、具有平移不变测度(即 Haar 测度)的拓扑群,例如局部紧的拓扑群,群上的连续正定函数可以用连续特征标关于对偶群上某个测度的积分表示.对于不具有平移不变测度的交换拓扑群,并不是每个连续正定函数都可以用上述积分表示.因而对于不具有平移不变的交换拓扑群,对群上的连续正定函数较难研究,关于抽象调和分析中其余的问题也有类似情     

Determination of the Direct Sums of Rational Groups by H-Representations of the Endomorphism Rings up to Equality

The problem of determination of Abelian groups (up to isomorphism) by their rings of endomorphisms in the class of completely decomposable torsion-free Abelian groups has been solved earlier. For the class of direct sums of rational groups, one can speak of determination of Abelian groups by rational representations of their endomorphism rings up to equality. In this paper, we consider this problem for the class of finite direct sums of rational groups and for some subclasses.     

Self-injective rings and linear (weak) inverses of linear finite automata over rings

LetR be a finite commutative ring with identity and τ be a nonnegative integer. In studying linear finite automata, one of the basic problems is how to characterize the class of rings which have the property that every (weakly) invertible linear finite automaton ℳ with delay τ over R has a linear finite automaton ℳ′ over R which is a (weak) inverse with delay τ of ℳ. The rings and linear finite automata are studied by means of modules and it is proved that *-rings are equivalent to self-injective rings, and the unsolved problem (for τ=0) is solved. Moreover, a further problem of how to characterize the class of rings which have the property that every invertible with delay τ linear finite automaton ℳ overR has a linear finite automaton ℳ′ over R which is an inverse with delay τ′ for some τ′⩾τ is studied and solved. Project supported by the National Natural Science Foundation of China(Grant No. 69773015).     

Lefschetz Motives and the Tate Conjecture

A Lefschetz class on a smooth projective variety is an element of the Q-algebra generated by divisor classes. We show that it is possible to define Q-linear Tannakian categories of abelian motives using the Lefschetz classes as correspondences, and we compute the fundamental groups of the categories. As an application, we prove that the Hodge conjecture for complex abelian varieties of CM-type implies the Tate conjecture for all Abelian varieties over finite fields, thereby reducing the latter to a problem in complex analysis.     

A result about Abelian automorphism groups

Some new techniques are given to prove that two sorts of Abelian groups cannot function as the full automorphism groups of the finite groups. With generality these techniques made a breakthrough in MacHale’s problem. Project supported by the National Natural Science Foundation of China.     

The partition problem for finite abelian groups

By the aid of a slight generalization of the Hales-Jewett theorem [Trans. Amer. Math. Soc.106 (1963), 222–229] we investigate the partition problem for finite Abelian groups. In particular the partition problem for the class of finitely generated free modules over Z_q is solved. By the results of Deuber and Rothschild [“Coll. Math. Soc. János Bolyai 18,” 1976] this yields a complete characterization of those finite Abelian groups with respect to which the class FAB of all finite Abelian groups has the partition property. Especially it turns out that FAB has the partition property with respect to the cyclic group Z_m, m > 1.     

A polynomial time algorithm to compute the Abelian kernel of a finite monoid

The time complexity of the best previously known algorithm to compute the Abelian kernel of a finite monoid with a fixed number of generators is exponential. In this paper we use results on subgroups of the free Abelian group and constructions on labeled graphs to develop a polynomial time algorithm for this problem.     

Codes projectifs à deux poids, “caps” complets et ensembles de différences

Using certain sets of points of a finite projective geometry some results are obtained from properties of two-weight projective codes. A problem concerning complete caps is solved. A deep connection between binary uniformily packed codes and difference sets over elementary Abelian 2-groups is established and a characterization of these difference sets is given.     

Abel群的一些分解定理的推广(I)

这项研究的目的是要把Abel群（有限或无限）的诸多分解定理尽可能地推广到主理想整环的模上,得到这类模上的分解定理,随后再把所得定理应用到向量空间（有限维或无限维）及其线性变换,得到向量空间的分解定理.本文是系列文章的第一篇,主要目的是建立起支撑整个研究的最基本概念,例如纯子模、有界模、局部循环模、具有minimax条件的模等.本文主要内容有： （1）确定了主理想整环上可除模、有界模、局部循环模的结构; （2）给出了主理想整环上拟循环模的生成性质,这类模在以后的研究里起着非常重要的作用; （3）描述了主理想整环上满足极小条件,minimax条件的模的结构; （4）给出了两个不同构的Z[i]-模,它们作为Abel群是同构的.     

A Polynomial Time Algorithm to Compute the Abelian Kernel of a Finite Monoid

Abstract. The time complexity of the best previously known algorithm to compute the Abelian kernel of a finite monoid with a fixed number of generators is exponential. In this paper we use results on subgroups of the free Abelian group and constructions on labeled graphs to develop a polynomial time algorithm for this problem.     

When is an Abelian group isomorphic to its endomorphism group?

In the paper, necessary and sufficient conditions for an Abelian group A to be isomorphic to the endomorphism group End(A) are obtained. The classes of periodic Abelian groups, divisible Abelian groups, nonreduced Abelian groups, and reduced algebraically compact Abelian groups are considered. For certain classes of Abelian groups, the isomorphism problem for a group and its endomorphism group is solved under the assumption that the endomorphism group itself has the corresponding property.