The Numbers of Permutation Groups Orbits and of the Wreath Product Orbits

ＴｈｅＮｕｍｂｅｒｓｏｆＰｅｒｍｕｔａｔｉｏｎＧｒｏｕｐｓＯｒｂｉｔｓａｎｄｏｆｔｈｅＷｒｅａｔｈＰｒｏｄｕｃｔＯｒｂｉｔｓ￥ＬｉＸｉａｎｚｈｏｎｇ；ＬｉｕＧｕａｎｇｌｉａｎｇ（ＰｕｙａｎｇＥｄｕｃａｔｉｏｎａｌＣｏｌｌｅｇｅ，Ｈｅｎａｎ，４５７００...     

On Permutation Groups of Degree a Product of Two Prime-Powers

We determine finite simple groups which have a subgroup of index with exactly two distinct prime divisors. Then from this we derive a classification of primitive permutation groups of degree a product of two prime-powers.     

F2^n上4次正形置换多项式的形式与计数

分组峦码是现代密码学中一个重要的研究分支,而置换理论在分组密码中有重要的地位．199j年,美国Tcledyne电子技术公司的Lothrop Mittenthal博士提出了一种置换,即正形置换．止形置换是一类完全映射,完全映射是由Mann在1942年研究正交拉丁方的构造时引入的,其具有良好的密码学性质（良好的扩散性和完令平衡性）,因此,正形置换常用来构造密码系统的算法,研究正形置换也就非常订必要．本文根据文章[1]的方法讨论了F2^n（n=4,5）上的4次正形置换多项式的形式与计数,至于n〉5的情形我们将在以后的篇章中继续讨论．     

F2n上4次正形置换多项式的形式与计数

分组密码是现代密码学中一个重要的研究分支,而置换理论在分组密码中有重要的地位.1995年,美国Teledyne电子技术公司的Lothrop Mittenthal博士提出了一种置换,即正形置换.正形置换是一类完全映射,完全映射是由Mann在1942年研究正交拉丁方的构造时引入的,其具有良好的密码学性质(良好的扩散性和完全平衡性),因此,正形置换常用来构造密码系统的算法,研究正形置换也就非常有必要.本文根据文章[1]的方法讨论了F2n(n=4,5)上的4次正形置换多项式的形式与计数,至于n5的情形我们将在以后的篇章中继续讨论.     

“装错信封问题”数学模型的求解及推广

本文给出了全错位排列问题数学模型的通解，全错位排列推广问题的通解．     

A Necessary Condition for Transitivity of a Finite Permutation Group

Suppose the group G is generated by permutations g₁, g₂, ...,g₈ acting on a set of size n, such that g₁g₂...g₈ is the identitypermutation. If the generator g_i has exactly c_i cycles (for1 i s), and G is transitive on , then n(s–2)– is a non-negative even integer. Thisis proved using an elementary graph-theoretic argument.     

The Number of Permutation Polynomials of a Given Degree Over a Finite Field

We relate the number of permutation polynomials in F_q[x] of degree d≤q−2 to the solutions (x₁,x₂,…,x_q) of a system of linear equations over F_q, with the added restriction that x_i≠0 and x_i≠x_j whenever i≠j. Using this we find an expression for the number of permutation polynomials of degree p−2 in F_p[x] in terms of the permanent of a Vandermonde matrix whose entries are the primitive pth roots of unity. This leads to nontrivial bounds for the number of such permutation polynomials. We provide numerical examples to illustrate our method and indicate how our results can be generalised to polynomials of other degrees.     

A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation

The genetic algorithm (GA) described in this paper breeds permutations of transmitters for minimum span frequency assignment. The approach hybridizes a GA with a greedy algorithm, and employs a technique called Generalized Saturation Degree to seed the initial population. Several permutation operators from the GA literature are compared, and results indicate that position based operators are more appropriate for this kind of problem than are order based operators. My offspring versus mid-parent correlation studies on crossovers show Pearson's correlation coefficient to be a reliable predictor of performance in most cases. Results presented herein represent improvements over previously published results.     

图的周长的一个度条件

本文用度和给出一个关于图的最长圈的存在性条件.这一结果是N.Dean和P.Fraisse的相应结论的推广.     

The Projection onto a Direct Product of Convex Cones

ＴｈｅＰｒｏｊｅｃｔｉｏｎｏｎｔｏａＤｉｒｅｃｔｒｏｄｕｃｔｏｆＣｏｎｖｅｘＣｏｎｅｓＬｉｕＷｅｉ（刘维）ａｎｄＳｈｉＮｉｎｇｚｈｏｎｇ（史宁中）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮｏｒｔｈｅａｓｔＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｃ...     

最大期望收益与最小期望损失决策一致性条件

本首先建立了条件收益值与条件损失值之间的关系，其次在理想期望概念的基础上建立了期望收益与期望损失之间的关系。然后给出了依据最大期望收益准则与最小期望损失准则决策一致性条件。     

The isomorphism problem for uniserial modules over an arbitrary ring

Abstract

First, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules. Later, under suitable assumptions on the lattice of the submodules, we give a method to partially solve the isomorphism problem for uniserial modules over an arbitrary ring. Particular attention is given to the natural class of uniserial modules defined over algebras given by quivers.     

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

Let r and s be nonnegative integers, and let G be a graph of order at least 3r + 4s. In Bialostocki et al. (Discrete Math 308:5886–5890, 2008), conjectured that if the minimum degree of G is at least 2r + 3s, then G contains a collection of r + s vertex-disjoint cycles such that s of them are chorded cycles, and they showed that the conjecture is true for r = 0, s = 2 and for s = 1. In this paper, we settle this conjecture completely by proving the following stronger statement; if the minimum degree sum of two nonadjacent vertices is at least 4r + 6s−1, then G contains a collection of r + s vertex-disjoint cycles such that s of them are chorded cycles.     

Harnack Inequality and Regularity for a Product of Symmetric Stable Process and Brownian Motion

In this paper, we consider a product of a symmetric stable process in ? ^d and a one-dimensional Brownian motion in ?^?+?. Then we define a class of harmonic functions with respect to this product process. We show that bounded non-negative harmonic functions in the upper-half space satisfy Harnack inequality and prove that they are locally Hölder continuous. We also argue a result on Littlewood–Paley functions which are obtained by the α-harmonic extension of an L ^p (? ^d ) function.     

A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected

A graphic sequence π =(d₁, d₂,..., d_n) is said to be forcibly k-edge-connected if every realization of π is k-edge-connected. In this paper, we obtain a new sufficient degree condition for π to be forcibly k-edgeconnected. We also show that this new sufficient degree condition implies a strongest monotone degree condition for π to be forcibly 2-edge-connected and a conjecture about a strongest monotone degree condition for π to be forcibly 3-edge-connected due to...     

GO-空间乘积正规性的充要条件

本文得到了任意两个GO-空间乘积正规性的一个充要条件.