On higher indicators of regular association schemes

In the present paper, we will define the higher Frobenius–Schur indicators and the higher indicators of association schemes as a generalization of those of finite groups. The higher indicators of any association scheme are always positive rational numbers. Especially, for any positive integer $n$, the $n$th indicator of any regular association scheme is the number of relations such that its strong girth divides $n$. Thus, all higher indicators of any regular association scheme are natural numbers, and the sequence of the indicators is periodic. We will show that the converses of these facts are also true for finite exponent association schemes. Finally, we introduce a family of infinite exponent association schemes all higher indicators of which are natural numbers and the sequence of the indicators of which is periodic.     

Primitive complete normal bases: Existence in certain 2-power extensions and lower bounds

The present paper is a continuation of the author’s work (Hachenberger (2001) [3]) on primitivity and complete normality. For certain 2-power extensions E over a Galois field F_q, we are going to establish the existence of a primitive element which simultaneously generates a normal basis over every intermediate field of E/F_q. The main result is as follows: Letq≡3mod4and letm(q)≥3be the largest integer such that2^m(q)dividesq²−1; ifE=F_q^2l, wherel≥m(q)+3, then there exists a primitive element inEthat is completely normal overF_q.Our method not only shows existence but also gives a fairly large lower bound on the number of primitive completely normal elements. In the above case this number is at least 4⋅(q−1)^2l−2. We are further going to discuss lower bounds on the number of such elements in r-power extensions, where r=2 and q≡1mod4, or where r is an odd prime, or where r is equal to the characteristic of the underlying field.     

The Ferry Cover Problem on Regular Graphs and Small-Degree Graphs

The ferry problem may be viewed as generalizations of the classical wolf-goat-cabbage puzzle. The ferry cover problem is to determine the minimum required boat capacity to safely transport n items represented by a conflict graph. The Alcuin number of a conflict graph is the smallest capacity of a boat for which the graph possesses a feasible ferry schedule. In this paper the authors determine the Alcuin number of regular graphs and graphs with maximum degree at most five.     

正则对策的N-M稳定集及其唯一存在定理

研究了有非对称性和负传递性偏好的无限策略对策,提出了N-M稳定集和正则对策的概念,其中N-M稳定集是将合作对策中由Von Neumann 和Morgenstern给出的相应概念引入到策略对策中的.所谓正则对策是指其Nash均衡集中每条链关于一致偏好总有上界的无限策略对策.证明了每个正则对策都有唯一N-M稳定集. 此结果及其应用例子说明正则对策N-M稳定集的概念对于策略对策的纯Nash均衡的精炼起着重要作用.     

Principal quasi-Baerness of formal power series rings

Let R be a ring. We consider left （or right） principal quasi-Baerness of the left skew formal power series ring R[[x;α]] over R where a is a ring automorphism of R. We give a necessary and sufficient condition under which the ring R[[x; α]] is left （or right） principally quasi-Baer. As an application we show that R[[x]] is left principally quasi-Baer if and only if R is left principally quasi- Baer and the left annihilator of the left ideal generated by any countable family of idempotents in R is generated by an idempotent.     

The existence of even regular factors of regular graphs on the number of cut edges

For any even integer k and any integer i, we prove that a （kr ＋i）-regular multigraph contains a k-factor if it contains no more than kr - 3k/2＋ i ＋ 2 cut edges, and this result is the best possible to guarantee the existence of k-factor in terms of the number of cut edges. We further give a characterization for k-factor free regular graphs.     

模糊预期收益率下风险损失率的左偏差度量

为在模糊预期收益率下度量证券的风险损失率 ,引入模糊数的左偏差的定义 ,给出模糊数的左偏差的一个性质和三角型模糊数的左偏差的计算公式。利用模糊预期收益率的左偏差定义了相应的风险损失率 ,这种定义能合理地反映证券的风险损失率与预期收益率之间的对应关系 ,并将这种关系用一个模糊集来表达 ,最给出一个应用示例     

特殊Thue系统表现的幺半群的两个性质

本文给出了有限特殊Ｃｈｕｒｃｈ－ＲｏｓｓｅｒＴｈｕｅ系统表现的上半群是群或正则半群的两个充要条件．并由此获得了判定该种幺半群是否群、正则半群的十分简单的算法．