Study of nitrogen ion implantation and diffusion phenomena on thin chromium layers followed by the atomic force microscopy and secondary ion mass spectroscopy techniques characterization

This research investigates the effect of ion implantation dosage level and further thermal treatment on the physical characteristics of chromium coatings on Si(1 1 1) substrates. Chromium films had been exposed to nitrogen ion fluencies of 1 × 10¹⁷, 3 × 10¹⁷, 6 × 10¹⁷ and 10 × 10¹⁷ N⁺ cm⁻² with a 15 keV energy level. Obtained samples had been heat treated at 450 °C at a pressure of 2 × 10⁻² Torr in an argon atmosphere for 30 h. Atomic force microscopy (AFM) images showed significant increase in surface roughness as a result of nitrogen ion fluence increase. Secondary ion mass spectroscopy (SIMS) studies revealed a clear increased accumulation of Cr₂N phase near the surface as a result of higher N⁺ fluence. XRD patterns showed preferred growth of [0 0 2] and [1 1 1] planes of Cr₂N phase as a result of higher ion implantation fluence. These results had been explained based on the nucleation-growth of Cr₂N phase and nitrogen atoms diffusion history during the thermal treatment process.     

关于“级别婚”的数学分析

介绍了19世纪存在于澳大利亚土著中的一种婚姻形式—级别婚,从群论的角度说明级别婚的三种主要形式都对应于一个对称群,从而可以用几何方法形象的表示这种婚姻形式;进而,从对称的观点说明婚姻形式从简单到复杂的演化过程,代数上对应于对称群阶数的增加,几何上则对应于对称性的加强.     

可解群的若干充分条件

A subgroup if of a group G is called semipermutable if it is permutable with every subgroup K of G with (|H|, |K|) - 1, and s-semipermutable if it is permutable with every Sylow p-subgroup of G with (p, |H|) = 1. In this paper, some sufficient conditions for a group to be solvable are obtained in terms of s-semipermutability.     

Graphs with Special Arcs and Cryptography

A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the case of graphs of high girth by comparing the probability to guess the message, (vertex) at random with the probability of breaking the key, i.e. guessing the encoding arc. In fact, the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem.In the case of parallelotopic graphs, there is a uniform way to match arcs with strings in a certain alphabet. Among parallelotopic graphs we distinguish linguistic graphs of affine type whose vertices (messages) and arcs (encoding tools) both could be naturally identified with vectors over the GF(q), and neighbors of the vertex defined by a system of linear equations. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for assymmetric cryptographic functions and related open key algorithms.Several constructions of families of linguistic graphs of high girth with good quality, complexity and expansion coefficients will be considered. Some of those constructions have been obtained via group-theoretical and geometrical techniques.     

The dual of a finitely generated multiplication module

This paper is based on the M. Sc. thesis written by the third author under the supervision of the first two authors. It was submitted to the University of Baghdad in 1986.     

A remark on Serrin’s Theorem

An approximation theorem for families of weakly coercive convex functions by means of countably many smooth families of convex functions is proved. As a consequence, the classical “three-fold” lower semicontinuity theorem for integral functionals of the Calculus of Variations by James Serrin is unified in one single statement.     

Algebraic models defined over Q of differential manifolds

Here we prove that every compact differential manifold has a smooth algebraic model defined over Q. In dimension 2 we find an algebraic model (may be singular) defined over Q and birational over Q to the projective plane.     

Caratheodory interpolation kernels

Kernels over the unit disk for which a version of Carathéodory interpolation is true are characterized in a simple computationally verifiable manner.     

A multiple character sum and a multipleL-function

In this paper we introduce a certain sum by using Dirichlet characters. We investigate the Riesz mean of the sum using the analytic properties of the MultipleL-function systematically. Eine überarbeitete Fassung ging am 6. 8. 2001 ein