61,117 research outputs found

    Nature of Decoupling in the Mixed Phase of Extremely Type-II Layered Superconductors

    Full text link
    The uniformly frustrated layered XY model is analyzed in its Villain form. A decouple pancake vortex liquid phase is identified. It is bounded by both first-order and second-order decoupling lines in the magnetic field versus temperature plane. These transitions, respectively, can account for the flux-lattice melting and for the flux-lattice depinning observed in the mixed phase of clean high-temperature superconductors.Comment: 11 pages of PLAIN TeX, 1 postscript figure, published version, many change

    Optimum pinning of the vortex lattice in extremely type-II layered superconductors

    Get PDF
    The two-dimensional (2D) vortex lattice in the extreme type-II limit is studied by Monte Carlo simulation of the corresponding 2D Coulomb gas, with identical pins placed at sites coinciding with the zero-temperature triangular vortex lattice. At weak pinning we find evidence for 2D melting into an intermediate hexatic phase. The strong pinning regime shows a Kosterlitz-Thouless transition, driven by interstitial vortex/anti-vortex excitations. A stack of such identical layers with a weak Josephson coupling models a layered superconductor with a triangular arrangement of columnar pins at the matching field. A partial duality analysis finds that layer decoupling of the flux-line lattice does not occur at weak pinning for temperatures below 2D melting.Comment: 5 pgs., 4 figs. To appear in PRB. Added size study of hexatic phas

    The Gremlin Graph Traversal Machine and Language

    Full text link
    Gremlin is a graph traversal machine and language designed, developed, and distributed by the Apache TinkerPop project. Gremlin, as a graph traversal machine, is composed of three interacting components: a graph GG, a traversal Ψ\Psi, and a set of traversers TT. The traversers move about the graph according to the instructions specified in the traversal, where the result of the computation is the ultimate locations of all halted traversers. A Gremlin machine can be executed over any supporting graph computing system such as an OLTP graph database and/or an OLAP graph processor. Gremlin, as a graph traversal language, is a functional language implemented in the user's native programming language and is used to define the Ψ\Psi of a Gremlin machine. This article provides a mathematical description of Gremlin and details its automaton and functional properties. These properties enable Gremlin to naturally support imperative and declarative querying, host language agnosticism, user-defined domain specific languages, an extensible compiler/optimizer, single- and multi-machine execution models, hybrid depth- and breadth-first evaluation, as well as the existence of a Universal Gremlin Machine and its respective entailments.Comment: To appear in the Proceedings of the 2015 ACM Database Programming Languages Conferenc

    Ï„\tau-Flavour Violation at the LHC

    Get PDF
    We study the conditions required for χ2→χ+τ±μ∓\chi_2 \to \chi + \tau^\pm \mu^\mp decays to yield observable tau flavour violation at the LHC, for cosmologically interesting values of the neutralino relic density. These condition can be achieved in the framework of a SU(5) model with a see-saw mechanism that allows a possible coexistence of a LHC signal a low prediction for radiative LFV decays.Comment: 7 pages, 5 figures, Prepared for the proceedings of the workshop: "LC09: e+e−e^+ e^- Physics at the TeV Scale and the Dark Matter Connection", 21-24 September 2009, Perugia, Ital
    • …
    corecore