978 research outputs found

    Magnetic bubble refraction and quasibreathers in inhomogeneous antiferromagnets

    Full text link
    The dynamics of magnetic bubble solitons in a two-dimensional isotropic antiferromagnetic spin lattice is studied, in the case where the exchange integral J(x,y) is position dependent. In the near continuum regime, this system is described by the relativistic O(3) sigma model on a spacetime with a spatially inhomogeneous metric, determined by J. The geodesic approximation is used to describe low energy soliton dynamics in this system: n-soliton motion is approximated by geodesic motion in the moduli space of static n-solitons, equipped with the L^2 metric. Explicit formulae for this metric for various natural choices of J(x,y) are obtained. From these it is shown that single soliton trajectories experience refraction, with 1/J analogous to the refractive index, and that this refraction effect allows the construction of simple bubble lenses and bubble guides. The case where J has a disk inhomogeneity (taking the value J_1 outside a disk, and J_2<J_1 inside) is considered in detail. It is argued that, for sufficiently large J_1/J_2 this type of antiferromagnet supports approximate quasibreathers: two or more coincident bubbles confined within the disk which spin internally while their shape undergoes periodic oscillations with a generically incommensurate period.Comment: Conference proceedings paper for talk given at Nonlinear Physics Theory and Experiment IV, Gallipoli, Italy, June 200

    Pattern Reduction in Paper Cutting

    Get PDF
    A large part of the paper industry involves supplying customers with reels of specified width in specifed quantities. These 'customer reels' must be cut from a set of wider 'jumbo reels', in as economical a way as possible. The first priority is to minimize the waste, i.e. to satisfy the customer demands using as few jumbo reels as possible. This is an example of the one-dimensional cutting stock problem, which has an extensive literature. Greycon have developed cutting stock algorithms which they include in their software packages. Greycon's initial presentation to the Study Group posed several questions, which are listed below, along with (partial) answers arising from the work described in this report. (1) Given a minimum-waste solution, what is the minimum number of patterns required? It is shown in Section 2 that even when all the patterns appearing in minimum-waste solutions are known, determining the minimum number of patterns may be hard. It seems unlikely that one can guarantee to find the minimum number of patterns for large classes of realistic problems with only a few seconds on a PC available. (2) Given an n → n-1 algorithm, will it find an optimal solution to the minimum- pattern problem? There are problems for which n → n - 1 reductions are not possible although a more dramatic reduction is. (3) Is there an efficient n → n-1 algorithm? In light of Question 2, Question 3 should perhaps be rephrased as 'Is there an efficient algorithm to reduce n patterns?' However, if an algorithm guaranteed to find some reduction whenever one existed then it could be applied iteratively to minimize the number of patterns, and we have seen this cannot be done easily. (4) Are there efficient 5 → 4 and 4 → 3 algorithms? (5) Is it worthwhile seeking alternatives to greedy heuristics? In response to Questions 4 and 5, we point to the algorithm described in the report, or variants of it. Such approaches seem capable of catching many higher reductions. (6) Is there a way to find solutions with the smallest possible number of single patterns? The Study Group did not investigate methods tailored specifically to this task, but the algorithm proposed here seems to do reasonably well. It will not increase the number of singleton patterns under any circumstances, and when the number of singletons is high there will be many possible moves that tend to eliminate them. (7) Can a solution be found which reduces the number of knife changes? The algorithm will help to reduce the number of necessary knife changes because it works by bringing patterns closer together, even if this does not proceed fully to a pattern reduction. If two patterns are equal across some of the customer widths, the knives for these reels need not be changed when moving from one to the other

    The geodesic approximation for lump dynamics and coercivity of the Hessian for harmonic maps

    Get PDF
    The most fruitful approach to studying low energy soliton dynamics in field theories of Bogomol'nyi type is the geodesic approximation of Manton. In the case of vortices and monopoles, Stuart has obtained rigorous estimates of the errors in this approximation, and hence proved that it is valid in the low speed regime. His method employs energy estimates which rely on a key coercivity property of the Hessian of the energy functional of the theory under consideration. In this paper we prove an analogous coercivity property for the Hessian of the energy functional of a general sigma model with compact K\"ahler domain and target. We go on to prove a continuity property for our result, and show that, for the CP^1 model on S^2, the Hessian fails to be globally coercive in the degree 1 sector. We present numerical evidence which suggests that the Hessian is globally coercive in a certain equivariance class of the degree n sector for n>1. We also prove that, within the geodesic approximation, a single CP^1 lump moving on S^2 does not generically travel on a great circle.Comment: 29 pages, 1 figure; typos corrected, references added, expanded discussion of the main function spac
    corecore