Structural and magnetic properties of Mn3-xCdxTeO6 (x = 0, 1, 1.5 and 2)

Mn3TeO6 exhibits a corundum-related A3TeO6 structure and a complex magnetic structure involving two magnetic orbits for the Mn atoms [*]. Mn3-xCdxTeO6 (x=0, 1, 1.5 and 2) ceramics were synthesized by solid state reaction and investigated using X-ray powder diffraction, electron microscopy, calorimetric and magnetic measurements. Cd2+ replaces Mn2+ cations without greatly affecting the structure of the compound. The Mn and Cd cations were found to be randomly distributed over the A-site. Magnetization measurements indicated that the samples order antiferromagnetically at low temperature with a transition temperature that decreases with increasing Cd doping. The nuclear and magnetic structure of one specially prepared 114Cd containing sample: Mn1.5(114Cd)1.5TeO6, was studied using neutron powder diffraction over the temperature range 2 to 295 K. Mn1.5(114Cd)1.5TeO6 was found to order in an incommensurate helical magnetic structure, very similar to that of Mn3TeO6 [*]. However, with a lower transition temperature and the extension of the ordered structure confined to order 240(10) {\AA}. [*] S. A. Ivanov et al. Mater. Res. Bull. 46 (2011) 1870.Comment: 20 pages, 8 figure

Affine and toric hyperplane arrangements

We extend the Billera-Ehrenborg-Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky's fundamental results on the number of regions.Comment: 32 pages, 4 figure

Spin and energy transfer in nanocrystals without transport of charge

We describe a mechanism of spin transfer between individual quantum dots that does not require tunneling. Incident circularly-polarized photons create inter-band excitons with non-zero electron spin in the first quantum dot. When the quantum-dot pair is properly designed, this excitation can be transferred to the neighboring dot via the Coulomb interaction with either {\it conservation} or {\it flipping} of the electron spin. The second dot can radiate circularly-polarized photons at lower energy. Selection rules for spin transfer are determined by the resonant conditions and by the strong spin-orbit interaction in the valence band of nanocrystals. Coulomb-induced energy and spin transfer in pairs and chains of dots can become very efficient under resonant conditions. The electron can preserve its spin orientation even in randomly-oriented nanocrystals.Comment: 13 pages, 3 figure

Molecular spintronics: Coherent spin transfer in coupled quantum dots

Time-resolved Faraday rotation has recently demonstrated coherent transfer of electron spin between quantum dots coupled by conjugated molecules. Using a transfer Hamiltonian ansatz for the coupled quantum dots, we calculate the Faraday rotation signal as a function of the probe frequency in a pump-probe setup using neutral quantum dots. Additionally, we study the signal of one spin-polarized excess electron in the coupled dots. We show that, in both cases, the Faraday rotation angle is determined by the spin transfer probabilities and the Heisenberg spin exchange energy. By comparison of our results with experimental data, we find that the transfer matrix element for electrons in the conduction band is of order 0.08 eV and the spin transfer probabilities are of order 10%.Comment: 13 pages, 6 figures; minor change

Security in the Age of Systemic Risk: Strategies, Tactics and Options for Dealing with Femtorisks and Beyond

The world today is increasingly confronted with systemic threats and challenges, in which femtorisks - small-scale dangers that are inherent to system structures and function and which pose asymmetrically catastrophic risks - can build in consequence, spreading uncontrollably like epidemics in both natural and social systems in such diverse areas as ecology, epidemiology, finance, the Internet, terrorism, and international relations. They have been successfully modeled in ecology in the context of complex adaptive systems: systems made up of individual agents, whose interactions have macroscopic consequences that feed back to influence individual behavior. While acknowledging challenges, this paper argues for the value of applying to societal systems the approaches that natural scientists have developed in quantifying and modeling biological interactions and ecosystems

Changes in anticoagulant prescription patterns over time for patients with atrial fibrillation around the world

Background: Prescribing patterns for stroke prevention in atrial fibrillation (AF) patients evolved with approval of non-Vitamin K antagonist oral anticoagulants (NOACs) over time.Objectives: To assess changes in anticoagulant prescription patterns in various geographical regions upon first approval of a NOAC and to analyze the evolution of oral anticoagulants (OACs) use over time in relation to CHA(2)DS(2)-VASc and HAS-BLED risk profiles.Methods: Global Registry on Long-Term Oral Antithrombotic Treatment in Patients with Atrial Fibrillation (GLORIA-AF) Phases II and III reported data on antithrombotic therapy for patients with newly diagnosed AF and >= 1 stroke risk factor. We focused on sites enrolling patients in both phases and reported treatment patterns for the first 4 years after initial NOAC approval.Results: From GLORIA-AF Phases II and III, 27 432 patients were eligible for this analysis. When contrasting the first year with the fourth year of enrolment, the proportion of NOAC prescriptions increased in Asia from 29.2% to 60.8%, in Europe from 53.4% to 75.8%, in North America from 49.0% to 73.9% and in Latin America from 55.7% to 71.1%. The proportion of Vitamin K antagonists (VKAs) use decreased across all regions over time, in Asia from 26.0% to 9.8%, in Europe from 35.5% to 16.8%, in North America from 28.9% to 12.1%, and in Latin America from 32.4% to 17.8%. In the multivariable analysis, factors associated with NOAC prescription were as follows: enrolment year, type of site, region, stroke and bleeding risk scores, and type and categorization of AF.Conclusions: During 4 years after the approval of the first NOAC, NOAC use increased, while VKA use decreased, across all regions.Thrombosis and Hemostasi

Hopf algebras and Markov chains: Two examples and a theory

The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown to induce a Markov chain in natural bases. Chains constructed in this way include widely studied methods of card shuffling, a natural "rock-breaking" process, and Markov chains on simplicial complexes. Many of these chains can be explictly diagonalized using the primitive elements of the algebra and the combinatorics of the free Lie algebra. For card shuffling, this gives an explicit description of the eigenvectors. For rock-breaking, an explicit description of the quasi-stationary distribution and sharp rates to absorption follow.Comment: 51 pages, 17 figures. (Typographical errors corrected. Further fixes will only appear on the version on Amy Pang's website, the arXiv version will not be updated.

Large-Scale Neighbor-Joining with NINJA

Abstract Neighbor-joining is a well-established hierarchical clustering algorithm for inferring phylogenies. It begins with observed distances between pairs of sequences, and clustering order depends on a metric related to those distances. The canonical algorithm requires O(n3) time and O(n2) space for n sequences, which precludes application to very large sequence families, e.g. those containing 100,000 sequences. Datasets of this size are available today, and such phylogenies will play an increasingly important role in comparative genomics studies. Recent algorithmic advances have greatly sped up neighbor-joining for inputs of thousands of sequences, but are limited to fewer than 13,000 sequences on a system with 4GB RAM. In this paper, I describe an algorithm that speeds up neighbor-joining by dramatically reducing the number of distance values that are viewed in each iteration of the clustering procedure, while still computing a correct neighbor-joining tree. This algorithm can scale to inputs larger than 100,000 sequences because of external-memory-efficient data structures. A free implementation may by obtained fro