On the density of the space of continuous and uniformly continuous functions

For X a metrizable space and (Y,ρ) a metric space, with Y pathwise connected, we compute the density of (C(X,(Y,ρ)),σ)—the space of all continuous functions from X to (Y,ρ), endowed with the supremum metric σ. Also, for (X,d) a metric space and (Y,‖⋅‖) a normed space, we compute the density of (UC((X,d),(Y,ρ)),σ) (the space of all uniformly continuous functions from (X,d) to (Y,ρ), where ρ is the metric induced on Y by ‖⋅‖). We also prove that the latter result extends only partially to the case where (Y,ρ) is an arbitrary pathwise connected metric space.To carry such an investigation out, the notions of generalized compact and generalized totally bounded metric space, introduced by the author and A. Barbati in a former paper, turn out to play a crucial rôle. Moreover, we show that the first-mentioned concept provides a precise characterization of those metrizable spaces which attain their extent.     

Coxeter complexes and graph-associahedra

Given a graph Γ, we construct a simple, convex polytope, dubbed graph-associahedra, whose face poset is based on the connected subgraphs of Γ. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that for any simplicial Coxeter system, the minimal blow-ups of its associated Coxeter complex has a tiling by graph-associahedra. The geometric and combinatorial properties of the complex as well as of the polyhedra are given. These spaces are natural generalizations of the Deligne-Knudsen-Mumford compactification of the real moduli space of curves.     

On extremally disconnected topological groups

We introduce the notion of a partially selective ultrafilter and prove that (a) if G is an extremally disconnected topological group and p is a converging nonprincipal ultrafilter on G containing a countable discrete subset, then p is partially selective, and (b) the existence of a nonprincipal partially selective ultrafilter on a countable set implies the existence of a P-point in ω^∗. Thus it is consistent with ZFC that there is no extremally disconnected topological group containing a countable discrete nonclosed subset.     

Effective magnetic properties of a composite material with circular conductive elements

Effective magnetic properties of a composite meta-material consisting of periodically arranged circular conductive elements are studied theoretically. A general expression for the effective bulk permeability is obtained with mutual effects and lattice ordering being taken into account. The resonance frequency of the permeability is found to be strongly dependent on the size and shape of the unit cell. Frequency dispersion of the permeability is studied with special attention paid to the frequency range, where negative values of the permeability are possible. Corresponding recommendations for optimisation of the meta-materials with negative permeability are made. The results are confirmed by numerical simulations of the finite structure behaviour in an external magnetic field. Received 19 April 2002 Published online 31 July 2002     

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     

Charge transport in a polypeptide chain

Charge transport is one important example of signal transduction in a protein which is responsible for action at a distance, and is a fundamental process in biochemical action. A model is presented in which electronic effects interact with motional processes to combine into a bifunctional model. This model is investigated with new detailed molecular dynamics calculations and successfully explains such action at a distance. Received 1st February 2002 / Received in final form 26 May 2002 Published online 13 September 2002     

双色激光场中1维共线氢分子离子的经典动力学研究

 运用经典理论方法，并采用辛算法数值求解了双色激光场作用下1维共线氢分子离子(H₂⁺)的哈密顿正则方程，得到了氢分子离子在激光场下的经典轨迹。计算了单色场和双色场下氢分子离子(H₂⁺)的存活几率、电离几率、解离几率、库仑爆炸几率随时间的演化，分析了双色场的相位、强度、强度比及倍频的变化对氢分子离子动力学行为的影响,并给出了相应的物理解释。     

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