Beryllium diffusion across GaAs/(Al,Ga)As heterojunctions and GaAs/AlAs superlattices during MBE growth

Beryllium diffusion during MBE growth of (Al, Ga)As layers, (Al, Ga)As/GaAs heterojunctions and GaAs/AlAs superlattices has been studied by electrochemical C-V and secondary ion mass spectrometry (SIMS) concentration profiling, in conjunction with transmission electron microscopy. Diffusion times were comparatively short since they were limited to part of the growth sequence, so non-equilibrium effects had a significant influence. The results are consistent with an interstitial-substitutional mechanism in which lattice site incorporation becomes more difficult with increasing band gap enthalpy. Incorporation involves a kick-out reaction which leads to the observed disordering of the superlattices.     

New nonlinear σ-model with N=4 extended supersymmetry

A new nonlinear -model with N=4 supersymmetry in d=2 is constructed in terms of a N=2 tensor multiplet in d=4. Four equivalent formulations of the theory in superspace are obtained. The component structure of the model is considered by means of the Legendre transformation.Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 9, pp. 70–74, September, 1987.     

Graph bisection algorithms with good average case behavior

In the paper, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixedd≧3, all sufficiently largen and allb=o(n ^{1?1/[(d+1)/2]}), the algorithm finds the minimum bisection for almost alld-regular labelled simple graphs with 2n nodes and bisection widthb. For example, the algorithm succeeds for almost all 5-regular graphs with 2n nodes and bisection widtho(n ^2/3). The algorithm differs from other graph bisection heuristics (as well as from many heuristics for other NP-complete problems) in several respects. Most notably:

1. the algorithm provides exactly the minimum bisection for almost all input graphs with the specified form, instead of only an approximation of the minimum bisection,
2. whenever the algorithm produces a bisection, it is guaranteed to be optimal (i.e., the algorithm also produces a proof that the bisection it outputs is an optimal bisection),
3. the algorithm works well both theoretically and experimentally,
4. the algorithm employs global methods such as network flow instead of local operations such as 2-changes, and
5. the algorithm works well for graphs with small bisections (as opposed to graphs with large bisections, for which arbitrary bisections are nearly optimal).

     

Some inequalities for partial orders

We establish some inequalities connecting natural parameters of a partial order P. For example, if every interval [a,b] contains at most maximal chains, if some antichain has cardinality v, and if there are ₁ chains whose union is cofinal and coinitial in P, then the chain decomposition number for P is ₁v (Theorem 2.2), and the inequality is sharp in a certain sense (Section 3).This paper was written while the authors were visitors at the Laboratoire d'algèbre ordinale, Département de Mathématiques, Université Claude Bernard, Lyon 1, France.Research supported by NSERC grant # A5198.     

The fixed point property in ordered sets of width two

We consider the fixed point property (FPP) in an ordered set of width two (every antichain contains at most two elements). The necessary condition of the FPP and a number of equivalent conditions to the FPP in such sets is established. The product theorem is proved, as well.     

Density of the set of attractive compacta

A compact set K in a smooth closed manifold M is said to be attractive, if on M there exists a system of differential equations, for which K is an asymptotically stable invariant set. It is proved that the set of attractive compacta is dense and its complement contains a dense set of type G in the space of all compacta of the manifold M endowed with two natural topologies.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 143, pp. 170–175, 1985.     

Problem of the extremal decomposition of a closed plane

One considers the problem of the maximum of the product of powers of conformal radii of nonoverlapping domains in the following formulation. Let A=a₁, ..., a_n and B=(b₁, ..., b_m be systems of distinguished points in ¯C and let ={₁,..., _m} be a system of positive numbers. ByU(D,b ) we denote the reduced modulus of the simply connected domain D relative to the pointb D. Find the maximum of the sum in the familyD of all systems of nonoverlapping simply connected domains D_j, j=1, ..., m, satisfying the following condition: the domain D_j does not contain points b_i B, different from b_j, and some collection A_j, for each domain, of points from A, _j=1 ^m A _j =A. The solution of this problem is obtained by the simultaneous use of the method of variation and of the method of the moduli of families of curves and is given by Theorem 1 of the present paper. As consequences of Theorem 1 one obtains Theorems 2 and 3, strengthening the corresponding results of a previous paper of the author.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 144, pp. 149–154, 1985.     

Errors of solutions of linear algebraic systems

Error estimates are derived for the following methods: the sweepout method for tridiagonal systems, the method of square roots, the bordering method, and the method of reflection matrices. The book of S. K. Godunov is devoted to the last method; he altered the method so that it takes any matrix into a bidiagonal matrix; a considerable part of that book is devoted to the error of this alteration. In the present paper the method of reflection matrices is studied in the form in which it is expounded in the familiar book of D. K. Faddeev and V. N. Faddeeva. Recurrent formulas are obtained for the sweepout method which make it possible to successively estimate errors of the components of the solution vector. In the method of square roots the error of the solution vector is estimated by the quantity Here _i and are small quantities; the first characterizes the accuracy of small arithmetics effects, and the second the round-off error in the reverse step. Further, A is the matrix of the system, m, is its order, f is the vector of free terms, and C and are constants with 0 <1. We shall not present here the rather involved estimates for the bordering method. The error of the solution vector obtained by the method of reflection matrices is estimated by the quantity (p_A is the conditioning number of the matrix A) All estimates are obtained up to terms of higher order of smallness than and ₁. The estimates themselves are related to the classification of errors of computing processes proposed by the author in recent years.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 139, pp. 94–110, 1984.     

Method for measuring the electron distribution function in the low temperature plasma with a high time resolution

A hybrid method for measuring the electron distribution function in the low temperature plasma is described. The time resolution of the measurement is of the order of several sec.