1,195 research outputs found
Interface Ferromagnetism in a SrMnO3/LaMnO3 Superlattice
Resonant soft x-ray absorption measurements at the O K edge on a
SrMnO3/LaMnO3 superlattice show a shoulder at the energy of doped holes, which
corresponds to the main peak of resonant scattering from the modulation in the
doped hole density. Scattering line shape at the Mn L3,2 edges has a strong
variation below the ferromagnetic transition temperature. This variation has a
period equal to half the superlattice superperiod and follows the development
of the ferromagnetic moment, pointing to a ferromagnetic phase developing at
the interfaces. It occurs at the resonant energies for Mn3+ and Mn4+ valences.
A model for these observations is presented, which includes a double-exchange
two-site orbital and the variation with temperature of the hopping frequency
tij between the two sites.Comment: 8.1 pages, 6 figure
Extremal Optimization at the Phase Transition of the 3-Coloring Problem
We investigate the phase transition of the 3-coloring problem on random
graphs, using the extremal optimization heuristic. 3-coloring is among the
hardest combinatorial optimization problems and is closely related to a 3-state
anti-ferromagnetic Potts model. Like many other such optimization problems, it
has been shown to exhibit a phase transition in its ground state behavior under
variation of a system parameter: the graph's mean vertex degree. This phase
transition is often associated with the instances of highest complexity. We use
extremal optimization to measure the ground state cost and the ``backbone'', an
order parameter related to ground state overlap, averaged over a large number
of instances near the transition for random graphs of size up to 512. For
graphs up to this size, benchmarks show that extremal optimization reaches
ground states and explores a sufficient number of them to give the correct
backbone value after about update steps. Finite size scaling gives
a critical mean degree value . Furthermore, the
exploration of the degenerate ground states indicates that the backbone order
parameter, measuring the constrainedness of the problem, exhibits a first-order
phase transition.Comment: RevTex4, 8 pages, 4 postscript figures, related information available
at http://www.physics.emory.edu/faculty/boettcher
Entropy-based analysis of the number partitioning problem
In this paper we apply the multicanonical method of statistical physics on
the number-partitioning problem (NPP). This problem is a basic NP-hard problem
from computer science, and can be formulated as a spin-glass problem. We
compute the spectral degeneracy, which gives us information about the number of
solutions for a given cost and cardinality . We also study an extension
of this problem for partitions. We show that a fundamental difference on
the spectral degeneracy of the generalized () NPP exists, which could
explain why it is so difficult to find good solutions for this case. The
information obtained with the multicanonical method can be very useful on the
construction of new algorithms.Comment: 6 pages, 4 figure
Simulation of ballistic impact of a tungsten carbide sphere on a confined silicon carbide target
The present investigation is a continuation of our previous stud
Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems
We review the understanding of the random constraint satisfaction problems,
focusing on the q-coloring of large random graphs, that has been achieved using
the cavity method of the physicists. We also discuss the properties of the
phase diagram in temperature, the connections with the glass transition
phenomenology in physics, and the related algorithmic issues.Comment: 10 pages, Proceedings of the International Workshop on
Statistical-Mechanical Informatics 2007, Kyoto (Japan) September 16-19, 200
Locked constraint satisfaction problems
We introduce and study the random "locked" constraint satisfaction problems.
When increasing the density of constraints, they display a broad "clustered"
phase in which the space of solutions is divided into many isolated points.
While the phase diagram can be found easily, these problems, in their clustered
phase, are extremely hard from the algorithmic point of view: the best known
algorithms all fail to find solutions. We thus propose new benchmarks of really
hard optimization problems and provide insight into the origin of their typical
hardness.Comment: 4 pages, 2 figure
Potential for carbon dioxide reduction from cement industry through increased use of industrial pozzolans
- …