Algebraic structure of association schemes of prime order

Finite groups of prime order must be cyclic. It is natural to ask what about association schemes of prime order. In this paper, we will give an answer to this question. An association scheme of prime order is commutative, and its valencies of nontrivial relations and multiplicities of nontrivial irreducible characters are constant. Moreover, if we suppose that the minimal splitting field is an abelian extension of the field of rational numbers, then the character table is the same as that of a Schurian scheme.     

建立在群对称轨道(SMO)及特征组态(CD)基础上的CI方法与程序发展

ISMO－CDCI方法点群理论，特别是不可约张量方法，在量子化学理论方法发展以及简化概念与计算方面，发挥了重要作用．但在国外的量子化学计算程序（如G94）中，在后自洽场（opt－SCF）计算方面，很少用到对称约化．在文献中，只见有关hbeltah群（DZh与它的子群）对称约化用于组态相关计算的报导．由于多重耦合系数的计算复杂，蜕化不可约表示多体问题的对称约化难于得到解决．我们提出了一个统一与普遍的方法，它能解决所有分子体系多体相关的点群对称约化问题［‘－6］，这个方法的核心是群对称轨道（SMO）概念的提出．SMO的基本特…     

Elektronenlokalisierung im Grundzustand und in angeregten Zuständen Pars-Orbital-Methode, 12. Mitt

UsingGleason's theorem the pars orbital concept is developed for excited states of conjugated systems described by CI-methods. A significance index is introduced to evaluate different patterns of fragmentation. The usefulness of this approach is illustrated for butadiene, biphenyl, naphthalene, and azulene.

11. Mitt.:H. Karpf, O. E. Polansky undM. Zander, Tetrahedron Lett.1978, 2069.     

On the Kernel of Restriction of Characters*

Let G be a finite group, H be a proper subgroup of G, and S be a unitary subring of C. The kernel of the restriction map S[Irr(G)] → S[Irr(H)] as a ring homomorphism is studied. As a corollary, the main result in [Isaacs, I. M. and Navarro, G., Injective restriction of characters, Arch. Math., 108, 2017, 437–439] is reproved.     

高空核电磁脉冲模拟波形的双指数函数拟合法

 许多标准和公开出版物中都用双指数函数描述高空核电磁脉冲典型波形。通过数值方法，研究了双指数函数一项重要的性质。根据该性质，详细讨论了高空核电磁脉冲模拟波形数值拟合中，双指数函数特征参数与脉冲峰值、前沿、后沿以及半宽等物理参数的关系，从而提出一种简单有效的脉冲参数计算方法。通过IEC标准中规定的高空核电磁脉冲参数的估计与一个实测高空核电磁脉冲模拟波形的数值拟合，验证了该方法的有效性和可靠性。该方法能够适应多种峰值、前沿和半宽的高宽核电磁脉冲模拟波形的数值拟合。     

Nonbinary convolutional codes derived from group character codes

New families of unit memory as well as multi-memory nonbinary convolutional codes are constructed algebraically in this paper. These convolutional codes are derived from the class of group character codes. The proposed codes have basic generator matrices, consequently, they are noncatastrophic. Additionally, the new code parameters are better than the ones available in the literature.     

On RSA moduli with almost half of the bits prescribed

We show that using character sum estimates due to H. Iwaniec leads to an improvement of recent results about the distribution and finding RSA moduli M=pl, where p and l are primes, with prescribed bit patterns. We are now able to specify about n bits instead of about n/2 bits as in the previous work. We also show that the same result of H. Iwaniec can be used to obtain an unconditional version of a combinatorial result of W. de Launey and D. Gordon that was originally derived under the Extended Riemann Hypothesis.     

Finding the maximum suffix with fewer comparisons

It is shown how to compute the lexicographically maximum suffix of a string of n?2 characters over a totally ordered alphabet using at most (4/3)n−5/3 three-way character comparisons. The best previous bound, which has stood unchallenged for more than 25 years, is (3/2)n−O(1) comparisons. We also prove an interesting property of an algorithm for computing the maximum suffix both with respect to a total order < and with respect to its inverse order >.