Searching for losers

We investigate the following process: N people select b losers by flipping coins. The 0-party continues until there are less than b losers; then the 1-party has to find the other losers by the same process. The average time for this process is about long₂ N, but this result requires rather advanced methods. Furthermore, the average size of a binary tree associated to this process and the average number of coin flippings are computed. The method used in this article can be used to give asympotical solutions of a special type of bivariate recurrences. © 1993 John Wiley & Sons, Inc.     

Electromagnetic field singularities

An integral transform based method is given for determining information about the locating and properties of singularities of electromagnetic fields associated with axially symmetric radiating sources.     

Formation of a two-dimensional periodic structure of local melting regions on a silicon surface upon pulsed light irradiation

The first results regarding the formation of a two-dimensional periodic structure of local melting regions on a silicon surface upon pulsed light irradiation are presented. The conditions are established, and the mechanism of the formation of such structures is discussed. Zh. Tekh. Fiz. 67, 97–99 (December 1997)     

State of and prospects for XeF(C−A) optically pumped lasers

Experimental and theoretical results are presented on an XeF(C?A) blue-green laser driven by 5-kJ energy. The laser was pumped by a ferrite-induced discharge of 90 cm in length. The output energy of 0.22 J was obtained with a plane-parallel resonator. A program to simulate laser operation has been developed. Numerical results for a wide range of conditions are compared with experiments performed by us and by other authors. It is found that intracavity refractive losses limit laser operation for XeF pressures above 3 torr. The laser efficiency strongly depends on the discharge-to-cavity length ratio. Possible ways to increase the laser power and efficiency are discussed.     

Numerical methods for finding multiple eigenvalues of matrices depending on parameters

Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996     

A new approach to the synthesis of 16-heteroprostanoids via isoxazole intermediates

Translated from Khimiya Geterotsiklicheskikh Soedinenii. Vol. 30. No. 3, pp. 424–425, March, 1994.     

Aziridinylketones and their cyclic anils. 12

We have measured the PMR spectra of 5, 7-diaryl-1, 4-diazabicyclo[4. ].O]hept-4-enes. We have studied the structure of the 5-(4-nitrophenyl)-7-phenyl derivative by x-ray diffraction. We show that the six-membered heterocycle has the half-chair form. The 6-H and 7-H protons of the aziridine ring are trans, while the 7-aryl is exo relative to the six-membered ring. Introduction of substituents into the aromatic ring has practically no effect on the geometry of the bicycle.Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 8, pp. 1117–1124, August, 1994.For Communication 11, see [1].