4,358 research outputs found

    Folding a Paper Strip to Minimize Thickness

    Get PDF
    In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain-valley pattern (plane graph of creases with relative fold orientations), but in general this specification is consistent with exponentially many possible folded states. We analyze the complexity of finding the best consistent folded state according to two metrics: minimizing the total number of layers in the folded state (so that a "flat folding" is indeed close to flat), and minimizing the total amount of paper required to execute the folding (where "thicker" creases consume more paper). We prove both problems strongly NP-complete even for 1D folding. On the other hand, we prove the first problem fixed-parameter tractable in 1D with respect to the number of layers.Comment: 9 pages, 7 figure

    Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths

    Get PDF
    When can a plane graph with prescribed edge lengths and prescribed angles (from among {0,180∘,360∘\{0,180^\circ, 360^\circ\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of single-vertex flat origami with prescribed mountain-valley assignment, which corresponds to the case of a cycle graph. We characterize such flat-foldable plane graphs by two obviously necessary but also sufficient conditions, proving a conjecture made in 2001: the angles at each vertex should sum to 360∘360^\circ, and every face of the graph must itself be flat foldable. This characterization leads to a linear-time algorithm for testing flat foldability of plane graphs with prescribed edge lengths and angles, and a polynomial-time algorithm for counting the number of distinct folded states.Comment: 21 pages, 10 figure

    Nuclear phenomena derived from quark-gluon strings

    Get PDF
    We propose a QCD based many-body model for the nucleus where the strong coupling regime is controlled by a three body string force and the weak coupling regime is dominated by a pairing force. This model operates effectively with a quark-gluon Lagrangian containing a pairing force from instantons and a baryonic string term which contains a confining potential. The unified model for weak and strong coupling regimes, is, however, only consistent at the border of perturbative QCD. The baryonic string force is necessary, as a {stability and} compressibility analysis shows, for the occurrence of the phases of nuclear matter. The model exhibits a quark deconfinement transition and chiral restoration which are suggested by QCD and give qualitatively correct numerics. The effective model is shown to be isomorphic to the Nambu-Jona-Lasinio model and exhibits the correct chirality provided that the chiral fields are identified with the 2-particle strings, which are natural in a QCD frameworkComment: 17 pages, 4 figures, 2 table

    Equilibrium tuned by a magnetic field in phase separated manganite

    Full text link
    We present magnetic and transport measurements on La5/8-yPryCa3/8MnO3 with y = 0.3, a manganite compound exhibiting intrinsic multiphase coexistence of sub-micrometric ferromagnetic and antiferromagnetic charge ordered regions. Time relaxation effects between 60 and 120K, and the obtained magnetic and resistive viscosities, unveils the dynamic nature of the phase separated state. An experimental procedure based on the derivative of the time relaxation after the application and removal of a magnetic field enables the determination of the otherwise unreachable equilibrium state of the phase separated system. With this procedure the equilibrium phase fraction for zero field as a function of temperature is obtained. The presented results allow a correlation between the distance of the system to the equilibrium state and its relaxation behavior.Comment: 13 pages, 5 figures. Submited to Journal of Physics: Condensed Matte

    Zipper unfolding of domes and prismoids

    Get PDF
    We study Hamiltonian unfolding—cutting a convex polyhedron along a Hamiltonian path of edges to unfold it without overlap—of two classes of polyhedra. Such unfoldings could be implemented by a single zipper, so they are also known as zipper edge unfoldings. First we consider domes, which are simple convex polyhedra. We find a family of domes whose graphs are Hamiltonian, yet any Hamiltonian unfolding causes overlap, making the domes Hamiltonian-ununfoldable. Second we turn to prismoids, which are another family of simple convex polyhedra. We show that any nested prismoid is Hamiltonian-unfoldable, and that for general prismoids, Hamiltonian unfoldability can be tested in polynomial time.National Science Foundation (U.S.) (Origami Design for Integration of Self-assembling Systems for Engineering Innovation Grant EFRI-1240383)National Science Foundation (U.S.) (Expedition Grant CCF-1138967

    Projectile-shape dependence of impact craters in loose granular media

    Full text link
    We report on the penetration of cylindrical projectiles dropped from rest into a dry, noncohesive granular medium. The cylinder length, diameter, density, and tip shape are all explicitly varied. For deep penetrations, as compared to the cylinder diameter, the data collapse onto a single scaling law that varies as the 1/3 power of the total drop distance, the 1/2 power of cylinder length, and the 1/6 power of cylinder diameter. For shallow penetrations, the projectile shape plays a crucial role with sharper objects penetrating deeper.Comment: 3 pages, 3 figures; experimen

    Any Monotone Function Is Realized by Interlocked Polygons

    Get PDF
    Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that makes the set of interlocked polygons free (not interlocked). This abstracts the essence of a kind of sliding block puzzle. We show that any monotone Boolean function Æ’ on n variables can be described by m = O(n) interlocked polygons. We also show that the decision problem that asks if given polygons are interlocked is PSPACE-complete

    Resonant magnetic mode in superconducting 2-leg ladders

    Full text link
    The spin dynamics of a doped 2-leg spin ladder is investigated by numerical techniques. We show that a hole pair-magnon boundstate evolves at finite hole doping into a sharp magnetic excitation below the two-particle continuum. This is supported by a field theory argument based on a SO(6)-symmetric ladder. Similarities and differences with the resonant mode of the high-Tc_c cuprates are discussed.Comment: 5 pages, 5 figure
    • …
    corecore