Condensation of all-cis-tetraphenylcyclotetrasiloxanetetraol in ammonia: new method for preparation of ladder-like polyphenylsilsesquioxanes

1. Download : Download high-res image (68KB)
2. Download : Download full-size image

     

Periodic Néel skyrmion transport

In this work, we have used the MuMax3 software to simulate devices consisting of a ferromagnetic thin film placed over a heavy metal thin film. The devices are two interconnected partial-disks where a Néel domain wall is formed in the disks junction. In our simulations we investigate devices with disk radius $r=50$ nm and different distance d between the disks centers (from $d=12$ nm to $d=2R=100$ nm). By applying strong sinusoidal external magnetic fields, we find a mechanism able to create, annihilate and even manipulate a skyrmion in each side of the device. This mechanism is discussed in terms of interactions between skyrmion and domain wall. The Néel domain wall formed in the center of the device interacts with the Néel skyrmion, leading to a process of transporting a skyrmion from one disk to the other periodically. Our results have relevance for potential applications in spintronics such as logical devices.     

Stability of O3 + N2, O3 + O2 and O3 + CO2 double hydrates: DFT study

1. Download : Download high-res image (151KB)
2. Download : Download full-size image

     

Gas adsorption in mcm-41 porous silicas dynamic measurements using sans

The European Physical Journal E - The isothermal gas adsorption of two hexane isomers (n-hexane and cyclohexane) in the mesopores of MCM-41 silica have been investigated by small angle neutron...     

Lagrangian for the t–J Model Constructed from the Generators of the Supersymmetric Hubbard Algebra

In order to describe the dynamics of the t–J model, two different families of first-order Lagrangians in terms of the generators of the Hubbard algebra are found. Such families correspond to different dynamical second-class constrained systems. The quantization is carried out by using the path-integral formalism. In this context the introduction of proper ghost fields is needed to render the model renormalizable. In each case the standard Feynman diagrammatics is obtained and the renormalized physical quantities are computed and analyzed. In the first case a nonperturbative large-N expansion is considered with the purpose of studying the generalized Hubbard model describing N-fold-degenerate correlated bands. In this case the 1/N correction to the renormalized boson propagator is computed. In the second case the perturbative Lagrangian formalism is developed and it is shown how propagators and vertices can be renormalized to each order. In particular, the renormalized ferromagnetic magnon propagator coming from our formalism is studied in details. As an example the thermal softening of the magnon frequency is computed. The antiferromagnetic case is also analyzed, and the results are confronted with previous one obtained by means of the spin-polaron theories.     

Effect of phonon scattering from neutral and charged impurity centers on the lattice heat conductivity of PbTe:(Tl, Na)

Experimental data on the effect of thallium and sodium impurities on the lattice heat conductivity of PbTe at room temperature are reported. Because the lattice of lead chalcogenides is strongly polarized near charged impurities, the effect of impurities on the lattice heat conductivity depends substantially on their charge state. This property of the material has been used to determine the charge state of the thallium impurity in PbTe. The results obtained argue for a model of quasi-local thallium-impurity states which assumes low electron-correlation energy at an impurity center. Fiz. Tverd. Tela (St. Petersburg) 40, 1206–1208 (July 1998)     

Bounds for rectilinear crossing numbers

A rectilinear drawing of a graph is one where each edge is drawn as a straight-line segment, and the rectilinear crossing number of a graph is the minimum number of crossings over all rectilinear drawings. We describe, for every integer k ≥ 4, a class of graphs of crossing number k, but unbounded rectilinear crossing number. This is best possible since the rectilinear crossing number is equal to the crossing number whenever the latter is at most 3. Further, if we consider drawings where each edge is drawn as a polygonal line segment with at most one break point, then the resulting crossing number is at most quadratic in the regular crossing number. © 1993 John Wiley & Sons, Inc.