435 research outputs found

    Dissipation characteristics of quantized spin waves in nano-scaled magnetic ring structures

    Full text link
    The spatial profiles and the dissipation characteristics of spin-wave quasi-eigenmodes are investigated in small magnetic Ni81_{81}Fe19_{19} ring structures using Brillouin light scattering microscopy. It is found, that the decay constant of a mode decreases with increasing mode frequency. Indications for a contribution of three-magnon processes to the dissipation of higher-order spin-wave quasi-eigenmodes are found

    Multiple Transitions to Chaos in a Damped Parametrically Forced Pendulum

    Full text link
    We study bifurcations associated with stability of the lowest stationary point (SP) of a damped parametrically forced pendulum by varying ω0\omega_0 (the natural frequency of the pendulum) and AA (the amplitude of the external driving force). As AA is increased, the SP will restabilize after its instability, destabilize again, and so {\it ad infinitum} for any given ω0\omega_0. Its destabilizations (restabilizations) occur via alternating supercritical (subcritical) period-doubling bifurcations (PDB's) and pitchfork bifurcations, except the first destabilization at which a supercritical or subcritical bifurcation takes place depending on the value of ω0\omega_0. For each case of the supercritical destabilizations, an infinite sequence of PDB's follows and leads to chaos. Consequently, an infinite series of period-doubling transitions to chaos appears with increasing AA. The critical behaviors at the transition points are also discussed.Comment: 20 pages + 7 figures (available upon request), RevTex 3.

    Direct observation of domain wall structures in curved permalloy wires containing an antinotch

    Get PDF
    The formation and field response of head-to-head domain walls in curved permalloy wires, fabricated to contain a single antinotch, have been investigated using Lorentz microscopy. High spatial resolution maps of the vector induction distribution in domain walls close to the antinotch have been derived and compared with micromagnetic simulations. In wires of 10 nm thickness the walls are typically of a modified asymmetric transverse wall type. Their response to applied fields tangential to the wire at the antinotch location was studied. The way the wall structure changes depends on whether the field moves the wall away from or further into the notch. Higher fields are needed and much more distorted wall structures are observed in the latter case, indicating that the antinotch acts as an energy barrier for the domain wal

    Approximately coloring graphs without long induced paths

    Get PDF
    It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on tt vertices, for fixed tt. We propose an algorithm that, given a 3-colorable graph without an induced path on tt vertices, computes a coloring with max⁡{5,2⌈t−12⌉−2}\max\{5,2\lceil{\frac{t-1}{2}}\rceil-2\} many colors. If the input graph is triangle-free, we only need max⁡{4,⌈t−12⌉+1}\max\{4,\lceil{\frac{t-1}{2}}\rceil+1\} many colors. The running time of our algorithm is O((3t−2+t2)m+n)O((3^{t-2}+t^2)m+n) if the input graph has nn vertices and mm edges

    Direct current control of three magnon scattering processes in spin-valve nanocontacts

    Full text link
    We have investigated the generation of spin waves in the free layer of an extended spin-valve structure with a nano-scaled point contact driven by both microwave and direct electric current using Brillouin light scattering microscopy. Simultaneously with the directly excited spin waves, strong nonlinear effects are observed, namely the generation of eigenmodes with integer multiple frequencies (2 \emph{f}, 3 \emph{f}, 4 \emph{f}) and modes with non-integer factors (0.5 \emph{f}, 1.5 \emph{f}) with respect to the excitation frequency \emph{f}. The origin of these nonlinear modes is traced back to three magnon scattering processes. The direct current influence on the generation of the fundamental mode at frequency \emph{f} can be related to the spin-transfer torque, while the efficiency of three-magnon-scattering processes is controlled by the Oersted field as an additional effect of the direct current

    Realization of XNOR and NAND spin-wave logic gates

    Full text link
    We demonstrate the functionality of spin-wave logic XNOR and NAND gates based on a Mach-Zehnder type interferometer which has arms implemented as sections of ferrite film spin-wave waveguides. Logical input signals are applied to the gates by varying either the phase or the amplitude of the spin waves in the interferometer arms. This phase or amplitude variation is produced by Oersted fields of dc current pulses through conductors placed on the surface of the magnetic films.Comment: 5 pages, 2 figure

    Complexity of Coloring Graphs without Paths and Cycles

    Full text link
    Let PtP_t and CℓC_\ell denote a path on tt vertices and a cycle on ℓ\ell vertices, respectively. In this paper we study the kk-coloring problem for (Pt,Cℓ)(P_t,C_\ell)-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of P5P_5-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that kk-colorability of P5P_5-free graphs for k≄4k \geq 4 does not. These authors have also shown, aided by a computer search, that 4-colorability of (P5,C5)(P_5,C_5)-free graphs does have a finite forbidden induced subgraph characterization. We prove that for any kk, the kk-colorability of (P6,C4)(P_6,C_4)-free graphs has a finite forbidden induced subgraph characterization. We provide the full lists of forbidden induced subgraphs for k=3k=3 and k=4k=4. As an application, we obtain certifying polynomial time algorithms for 3-coloring and 4-coloring (P6,C4)(P_6,C_4)-free graphs. (Polynomial time algorithms have been previously obtained by Golovach, Paulusma, and Song, but those algorithms are not certifying); To complement these results we show that in most other cases the kk-coloring problem for (Pt,Cℓ)(P_t,C_\ell)-free graphs is NP-complete. Specifically, for ℓ=5\ell=5 we show that kk-coloring is NP-complete for (Pt,C5)(P_t,C_5)-free graphs when k≄4k \ge 4 and t≄7t \ge 7; for ℓ≄6\ell \ge 6 we show that kk-coloring is NP-complete for (Pt,Cℓ)(P_t,C_\ell)-free graphs when k≄5k \ge 5, t≄6t \ge 6; and additionally, for ℓ=7\ell=7, we show that kk-coloring is also NP-complete for (Pt,C7)(P_t,C_7)-free graphs if k=4k = 4 and t≄9t\ge 9. This is the first systematic study of the complexity of the kk-coloring problem for (Pt,Cℓ)(P_t,C_\ell)-free graphs. We almost completely classify the complexity for the cases when k≄4,ℓ≄4k \geq 4, \ell \geq 4, and identify the last three open cases

    Analysis of chaotic motion and its shape dependence in a generalized piecewise linear map

    Full text link
    We analyse the chaotic motion and its shape dependence in a piecewise linear map using Fujisaka's characteristic function method. The map is a generalization of the one introduced by R. Artuso. Exact expressions for diffusion coefficient are obtained giving previously obtained results as special cases. Fluctuation spectrum relating to probability density function is obtained in a parametric form. We also give limiting forms of the above quantities. Dependence of diffusion coefficient and probability density function on the shape of the map is examined.Comment: 4 pages,4 figure

    On the computation of zone and double zone diagrams

    Full text link
    Classical objects in computational geometry are defined by explicit relations. Several years ago the pioneering works of T. Asano, J. Matousek and T. Tokuyama introduced "implicit computational geometry", in which the geometric objects are defined by implicit relations involving sets. An important member in this family is called "a zone diagram". The implicit nature of zone diagrams implies, as already observed in the original works, that their computation is a challenging task. In a continuous setting this task has been addressed (briefly) only by these authors in the Euclidean plane with point sites. We discuss the possibility to compute zone diagrams in a wide class of spaces and also shed new light on their computation in the original setting. The class of spaces, which is introduced here, includes, in particular, Euclidean spheres and finite dimensional strictly convex normed spaces. Sites of a general form are allowed and it is shown that a generalization of the iterative method suggested by Asano, Matousek and Tokuyama converges to a double zone diagram, another implicit geometric object whose existence is known in general. Occasionally a zone diagram can be obtained from this procedure. The actual (approximate) computation of the iterations is based on a simple algorithm which enables the approximate computation of Voronoi diagrams in a general setting. Our analysis also yields a few byproducts of independent interest, such as certain topological properties of Voronoi cells (e.g., that in the considered setting their boundaries cannot be "fat").Comment: Very slight improvements (mainly correction of a few typos); add DOI; Ref [51] points to a freely available computer application which implements the algorithms; to appear in Discrete & Computational Geometry (available online
    • 

    corecore