关于剩余有限群的Profinite完备化

设G是个剩余有限群,本文深入地讨论了G的Profinite完备化之间的关系,得到了整齐的结     

关于剩余有限群的Profinite完备化

设G是个剩余有限群,本文深入地讨论了G的Profinite完备化之间的关系,得到了整齐的结果.     

无限可解群全形的剩余有限性质

给出了S₀-群的特征群列Abel商因子的排序, 得到了S₁ -群全形的剩余有限性质, 证明了: 若S₁-群G的Fitting子群的中心是既约的, 则其全形Hol(G)是剩余有限π-群, 这里π是有限个素数的集合.     

一类图设计的构造

设Kv是一个v点完全图,G是一个有限简单图,Kv上的一个图设计G-GD(v)是一个对子(X,B),其中X是Kv的顶点集合,B是Kv的一些与G同构的子图(称为区组)的集合,使得Kv的任意一条边恰出现在B的一个区组中．文中讨论的简单图是C(r)10,即带有一条弦的10长圈(含有11条边),其中r表示弦的两个端点之间的顶点个数,1≤r≤4．给出了C^（r）10-GD(v)的存在谱：v=0,1(mod11)且v≥11．     

关于哥德巴赫猜想的一个注记

基于哥德巴赫猜想问题的研究,应用筛法在首项为3、公差为2的等差数列集合与所定义的哥德巴赫集合的元素中将含有奇素数及其所有倍数的元素逐次分离出去之后,分别得到了其剩余元素总量的数学表达式及素数分布的均值公式,进而确定了哥德巴赫集合剩余元素中素数对与合数对的个数之差与任一不小于12的有限偶数之间的函数关系,由此推导出的渐近公式证明了哥德巴赫猜想表法个数不小于1并确定了其分布范围.     

二次剩余问题的一个新定理

研究了二次剩余问题,利用整数分类的办法,给出了|Jn|和|Qn|的公式(这里n是奇合数,Jn是Zn*中有Jacobi符号为1的所有元素的集合,Qn是模n的所有二次剩余的集合) .基于这些结果,可以得出当a对模n的Jacobi符号等于1时,正确猜测a为模n的二次剩余的可能性,从而推广了[1]p .74中的结果.     

論多面体映入n維球的分类問題

<正> 設K为n+r維有限多面体,S~n为n維球.把連續映像f:K~(n+r)→S~n的全体看成一个集合,在这个集合中二个映像f_0,f_1之間,如果存在同伦关系,即有連續映像F:K~(n+r)×I→S~n存在,使得     

剩余格与正则剩余格的特征定理

本文进一步研究了具有广泛应用的一类模糊逻辑代数系统——剩余格，并引入了正则剩余格的概念，对剩余格与正则剩余格的定义进行了讨论，给出了剩余格与正则剩余格的特征定理，其中包含剩余格与正则剩余格的等式特征，从而这两个格类都构成簇．本文还讨论了剩余格与正则剩余格公理系统的独立性，以及它们与相近代数结构的关系．     

广义剩余蕴涵北大核心

本文基于一般的聚合算子,提出一类新的模糊蕴涵,称之为广义剩余蕴涵.广义剩余蕴涵是模糊逻辑中十分重要的剩余蕴涵的自然推广.我们进一步讨论这类蕴涵的基本性质,并且探究广义剩余蕴涵与由模糊合取生成的蕴涵之间的关系,并证明这两类蕴涵为不同的蕴涵.这些结果在模糊逻辑与模糊决策之间建立了新的联系.     

伪统一模与剩余格之间的关系

讨论伪统一模与剩余格之间的关系,证明完备格上无穷∨-分配伪统一模和它的剩余蕴涵算子构成一个完备剩余格,并说明任给一个完备剩余格L=(L,∧,∨,*,e→,,*是无穷∨-分配的伪统一模,→和(?)是*的剩余蕴涵算子.     

Ultraproducts of continuous posets

We consider local partial clones defined on an uncountable set E having the form Polp(\({\mathfrak{R}}\)), where \({\mathfrak{R}}\) is a set of relations on E. We investigate the notion of weak extendability of partial clones of the type Polp(\({\mathfrak{R}}\)) (in the case of E countable, this coincides with the notion of extendability previously introduced by the author in 1987) which allows us to expand to uncountable sets results on the characterization of Galois-closed sets of relations as well as model-theoretical properties of a relational structure \({\mathfrak{R}}\). We establish criteria for positive primitive elimination sets (sets of positive primitive formulas over \({\mathfrak{R}}\) through which any positive primitive definable relation over \({\mathfrak{R}}\) can be expressed without existential quantifiers) for finite \({\mathfrak{R}}\) as well as for \({\mathfrak{R}}\) having only finite number of positive primitive definable relations of any arity. Emphasizing the difference between countable and uncountable sets, we show that, unlike in the countable case, the characterization of Galois-closed sets InvPol(\({\mathfrak{R}}\)) (that is, all relations which are invariant under all operations from the clone Pol(\({\mathfrak{R}}\)) defined on an uncountable set) cannot be obtained via the application of finite positive primitive formulas together with infinite intersections and unions of updirected sets of relations from \({\mathfrak{R}}\).     

关于等差数列型素数集的分解

设C为非负整数集.若存在非负整数集A和B,使得C=A+B,其中|A|,|B|≥2,则称C为可分解的,否则称C为不可分解的或本原的.讨论特殊的等差数列型素数集合,证明了4k+1型素数集不可分解,以及4k+3型素数集不可分解.     

仿射酉群作用下的面轨道生成的格

设AUG(n,Fq2)是Fq2上的n维仿射酉空间,AUn(Fq2)是Fq2上的n次仿射酉群,设M(m,r)是AUn(Fq2)作用下的(m,r)面的轨道.用L(m,r)表示M(m,r)中面的交生成的集合.讨论了各轨道生成的集合之间的包含关系,一个面属于M(m,r)生成的集合的条件,以及L(m,r)是几何格的充要条件.     

Explicit determination of certain minimal constabelian codes

Constabelian codes can be viewed as ideals in twisted group algebras over finite fields. In this paper we study decomposition of semisimple twisted group algebras of finite abelian groups and prove results regarding complete determination of a full set of primitive orthogonal idempotents in such algebras. We also explicitly determine complete sets of primitive orthogonal idempotents of twisted group algebras of finite cyclic and abelian p-groups. We also describe methods of determining complete set of primitive idempotents of abelian groups whose orders are divisible by more than one prime and give concrete (numerical) examples of minimal constabelian codes, illustrating the above mentioned results.     

ADDITIVE POLYNOMIALS AND PRIMITIVE ROOTS OVER FINITE FIELDS

We prove existence of primitive roots with a prescribed non-zero image using the arithmetic of algebraic function fields for a class of polynomials over sufficiently large finite fields.     

Primitive positive clones of groupoids

We prove that if two finite groupoids with unity have the same ternary compatible relations, then they have the same primitive positive clones. Received October 23, 2007; accepted in final form February 22, 2008.     

对称群S5的表示环

本文利用有限群特征标理论计算了对称群S₅的所有不可约复表示的幂公式.根据求解幂公式过程中得到的S₅任意两个不可约表示张量积的分解情况,作者刻画了S₅上表示环r(S₅)及其若干结构性质,如极小生成元关系式表达、单位群、本原幂等元、行列式与Casimir数.     

A note on zeta functions of Ihara type for normal Kähler graphs

A regular Kähler graph is a compound of two regular graphs. When adjacency operators of component graphs are commutative, we introduce equivalence relations on sets of primitive bicolored paths, which are considered as sets of trajectory-segments of magnetic fields on this Kähler graph, we study their zeta functions of Ihara type, and show a correspondence to those for ordinary regular graphs.     

围长为r的n阶本原有向图的点指数

研究本原有向图的顶点指数,运用图论与数论方法,得到了n阶围长为r的本原有向图的点指数expD（k）的上界：若rn,且r为素数,D∈Dn,r={D｜D为n阶本原有向图且围长为r},则expD（n,k）=rn-2r＋k（1≤k≤n）;若r｜n,且r为素数或素数的幂,D∈Dn,r,则expD（n,1）=rn-3r＋2.     

Generalized periodicity and primitivity for words

Starting from six kinds of periodicity of words we define six sets of words which are primitive in different senses and we investigate their relationships. We show that only three of the sets are external Marcus contextual languages with choice but none of them is an external contextual language without choice or an internal contextual language. For the time complexity of deciding any of our sets by one-tape Turing machines, n ² is a lower bound and this is optimal in two cases. The notions of roots and degrees of words and languages, which are strongly connected to periodicity and primitivity, are also considered, and we show that there can be an arbitrarily large gap between the complexity of a language and that of its roots. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)