15,076 research outputs found

    Soliton topology versus discrete symmetry in optical lattices

    Full text link
    We address the existence of vortex solitons supported by azimuthally modulated lattices and reveal how the global lattice discrete symmetry has fundamental implications on the possible topological charges of solitons. We set a general ``charge rule'' using group-theory techniques, which holds for all lattices belonging to a given symmetry group. Focusing in the case of Bessel lattices allows us to derive also a overall stability rule for the allowed vortex solitons.Comment: 4 pages, 3 figures. To appear in Phys. Rev. Let

    Drinfeld Twists and Symmetric Bethe Vectors of Supersymmetric Fermion Models

    Full text link
    We construct the Drinfeld twists (factorizing FF-matrices) of the gl(mn)gl(m|n)-invariant fermion model. Completely symmetric representation of the pseudo-particle creation operators of the model are obtained in the basis provided by the FF-matrix (the FF-basis). We resolve the hierarchy of the nested Bethe vectors in the FF-basis for the gl(mn)gl(m|n) supersymmetric model.Comment: Latex File, 24 pages, no figure, some misprints are correcte

    Determinant representations of scalar products for the open XXZ chain with non-diagonal boundary terms

    Full text link
    With the help of the F-basis provided by the Drinfeld twist or factorizing F-matrix for the open XXZ spin chain with non-diagonal boundary terms, we obtain the determinant representations of the scalar products of Bethe states of the model.Comment: Latex file, 28 pages, based on the talk given by W. -L. Yang at Statphys 24, Cairns, Australia, 19-23 July, 201

    A numerical method to solve the Boltzmann equation for a spin valve

    Full text link
    We present a numerical algorithm to solve the Boltzmann equation for the electron distribution function in magnetic multilayer heterostructures with non-collinear magnetizations. The solution is based on a scattering matrix formalism for layers that are translationally invariant in plane so that properties only vary perpendicular to the planes. Physical quantities like spin density, spin current, and spin-transfer torque are calculated directly from the distribution function. We illustrate our solution method with a systematic study of the spin-transfer torque in a spin valve as a function of its geometry. The results agree with a hybrid circuit theory developed by Slonczewski for geometries typical of those measured experimentally.Comment: 13 pages, 8 figure

    Non-polynomial Worst-Case Analysis of Recursive Programs

    Full text link
    We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions. We show that measure functions provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in nonpolynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form O(nlogn)\mathcal{O}(n\log n) as well as O(nr)\mathcal{O}(n^r) where rr is not an integer. We present experimental results to demonstrate that our approach can obtain efficiently worst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the divide-and-conquer algorithm for the Closest-Pair problem, where we obtain O(nlogn)\mathcal{O}(n \log n) worst-case bound, and (ii) Karatsuba's algorithm for polynomial multiplication and Strassen's algorithm for matrix multiplication, where we obtain O(nr)\mathcal{O}(n^r) bound such that rr is not an integer and close to the best-known bounds for the respective algorithms.Comment: 54 Pages, Full Version to CAV 201

    Determinant Representations of Correlation Functions for the Supersymmetric t-J Model

    Full text link
    Working in the FF-basis provided by the factorizing FF-matrix, the scalar products of Bethe states for the supersymmetric t-J model are represented by determinants. By means of these results, we obtain determinant representations of correlation functions for the model.Comment: Latex File, 41 pages, no figure; V2: minor typos corrected, V3: This version will appear in Commun. Math. Phy

    Integrating fluctuations into distribution of resources in transportation networks

    Full text link
    We propose a resource distribution strategy to reduce the average travel time in a transportation network given a fixed generation rate. Suppose that there are essential resources to avoid congestion in the network as well as some extra resources. The strategy distributes the essential resources by the average loads on the vertices and integrates the fluctuations of the instantaneous loads into the distribution of the extra resources. The fluctuations are calculated with the assumption of unlimited resources, where the calculation is incorporated into the calculation of the average loads without adding to the time complexity. Simulation results show that the fluctuation-integrated strategy provides shorter average travel time than a previous distribution strategy while keeping similar robustness. The strategy is especially beneficial when the extra resources are scarce and the network is heterogeneous and lowly loaded.Comment: 14 pages, 4 figure

    Resistance distance, information centrality, node vulnerability and vibrations in complex networks

    Get PDF
    We discuss three seemingly unrelated quantities that have been introduced in different fields of science for complex networks. The three quantities are the resistance distance, the information centrality and the node displacement. We first prove various relations among them. Then we focus on the node displacement, showing its usefulness as an index of node vulnerability.We argue that the node displacement has a better resolution as a measure of node vulnerability than the degree and the information centrality
    corecore