Structures and stability of Al<Subscript><Emphasis Type="Bold">7</Emphasis></Subscript>C and Al<Subscript><Emphasis Type="Bold">7</Emphasis></Subscript>N clusters

We report results of the atomic and electronic structures of Al₇C cluster using ab initio molecular dynamics with ultrasoft pseudopotentials and generalized gradient approximation. The lowest energy structure is found to be the one in which carbon atom occupies an interstitial position in Al₇ cluster. The electronic structure shows that the recent observation [Chem. Phys. Lett. 316, 31 (2000)] of magic behavior of Al₇C^- cluster is due to a large highest occupied and lowest unoccupied molecular orbital (HOMO-LUMO) gap which makes Al₇C^- chemically inert. These results have further led us to the finding of a new neutral magic cluster Al₇N which has the same number of valence electrons as in Al₇C^- and a large HOMO-LUMO gap of 1.99 eV. Further, calculations have been carried out on (Al₇N)₂ to study interaction between magic clusters. Received 28 July 2001     

Momentum transport and torque scaling in Taylor-Couette flow from an analogy with turbulent convection

We generalize an analogy between rotating and stratified shear flows. This analogy is summarized in Table 1. We use this analogy in the unstable case (centrifugally unstable flow vs. convection) to compute the torque in Taylor-Couette configuration, as a function of the Reynolds number. At low Reynolds numbers, when most of the dissipation comes from the mean flow, we predict that the non-dimensional torque G = T/ν² L, where L is the cylinder length, scales with Reynolds number R and gap width η, G = 1.46η^3/2(1 - η)^-7/4 R ^3/2. At larger Reynolds number, velocity fluctuations become non-negligible in the dissipation. In these regimes, there is no exact power law dependence the torque versus Reynolds. Instead, we obtain logarithmic corrections to the classical ultra-hard (exponent 2) regimes: G = 0.50 . These predictions are found to be in excellent agreement with avail-able experimental data. Predictions for scaling of velocity fluctuations are also provided. Received 7 June 2001 and Received in final form 7 December 2001     

A novel and efficient synthesis of porphine

meso-Tetra(n-hexyloxycarbonyl)porphyrin was found to be converted into porphine, the mother compound of porphyrins, in a 77% yield when heated in aqueous sulfuric acid at 180 °C over 30 min under an inert atmosphere. The observation demonstrates that the substituted porphyrin serves as a novel and useful precursor for porphine.     

On Quantum Team Games

Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied.     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

Harmonic mappings of the Sierpinski gasket to the circle

Harmonic mappings from the Sierpinski gasket to the circle are described explicitly in terms of boundary values and topological data. In particular, all such mappings minimize energy within a given homotopy class. Explicit formulas are also given for the energy of the mapping and its normal derivatives at boundary points.

     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008