Lattice vibrations of armchair carbon nanotubes: phonons,soliton deformations and lattice discreteness effects

Small and large-amplitude elastic deformations of the armchair structure of single-walled carbon nanotubes are investigated with emphasis on the cylindrical geometry. As starting model, we consider a discrete one-dimensional lattice of atoms interacting via a Lennard-Jones type two-body potential. In an expansion scheme using cylindrical coordinates where radial displacements are assumed negligible compared to the angular motions, a sine-lattice Hamiltonian is derived. In the limit of small-amplitude angular displacements, the dispersion spectrum of acoustic phonons is derived and the associate characteristic frequency is given as a function of parameters of the model. In the large-amplitude regime, lattice vibrations give rise to kink-type deformations which move undergoing lattice dispersion and lattice discreteness effects. The dispersion law of the kink motion is obtained and shown to lower the effect of lattice discreteness, giving rise to a vanishing Peierls stress for kink sizes of the order of a few lattice spacings. Implications of the coupling of two armchair structures on the stability of vibrational modes of an individual armchair nanotube are also discussed. A gap of forbidden modes is predicted in the phonon spectrum while the energy needed to create a kink deformation in individual nanotubes is shifted in the presence of a wall-to-wall interaction.Received: 2 August 2004, Published online: 14 December 2004PACS: 81.07.De Nanotubes - 62.30. + d Mechanical and elastic waves-vibrations - 63.22. + m Phonons in low-dimensional nanoscale materials - 63.20.Ry Anharmonic lattices modes     

Unavoidable Traces Of Set Systems

Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.     

On the non existence of monotone linear schema for some linear parabolic equations

In this Note, we present a result concerning the non existence of linear monotone schema with fixed stencil on regular meshes for some linear parabolic equation in two dimensions. The parabolic equations of interest arise from non isotropic diffusion modelling. A corollary is that no linear monotone 9 points-schemes can be designed for the one-dimensional heat equation emerged in the plane with an arbitrary direction of diffusion. Some applications of this result are provided: for the Fokker–Planck–Lorentz model for electrons in the context of plasma physics; all linear monotone scheme for the one-dimensional hyperbolic heat equation treated as a two-dimensional problem are not consistent in the diffusion limit for an arbitrary direction of propagation. We also examine the case of the Landau equation. To cite this article: C. Buet, S. Cordier, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Propriétés statistiques des entiers friables

Let Ψ(x,y) (resp. Ψ_m(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψ_m(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37     

Substructuring preconditioners for saddle-point problems arising from Maxwell's equations in three dimensions

This paper is concerned with the saddle-point problems arising from edge element discretizations of Maxwell's equations in a general three dimensional nonconvex polyhedral domain. A new augmented technique is first introduced to transform the problems into equivalent augmented saddle-point systems so that they can be solved by some existing preconditioned iterative methods. Then some substructuring preconditioners are proposed, with very simple coarse solvers, for the augmented saddle-point systems. With the preconditioners, the condition numbers of the preconditioned systems are nearly optimal; namely, they grow only as the logarithm of the ratio between the subdomain diameter and the finite element mesh size.

     

Un principe d'invariance relatif à un processus généralisant le mouvement brownien N-dimensionnel

We prove that the generalized random walks associated to a root system R in $\text{R}{}^{\mathrm{N}}$ and a nonnegative multiplicity function k defined on R, converge in distribution (if suitably normalized) to a Markov process with càdlàg trajectories and infinitesimal generator a differential-difference operator on $\text{R}{}^{\mathrm{N}}$ which generalizes the usual Laplacian. To cite this article: L. Gallardo, L. Godefroy, C. R. Acad. Sci. Paris, Ser. I 338 (2004).