Critical behavior of the Random-Field Ising Magnet with long range correlated disorder

We study the correlated-disorder driven zero-temperature phase transition of the Random-Field Ising Magnet using exact numerical ground-state calculations for cubic lattices. We consider correlations of the quenched disorder decaying proportional to r^a, where r is the distance between two lattice sites and a<0. To obtain exact ground states, we use a well established mapping to the graph-theoretical maximum-flow problem, which allows us to study large system sizes of more than two million spins. We use finite-size scaling analyses for values a={-1,-2,-3,-7} to calculate the critical point and the critical exponents characterizing the behavior of the specific heat, magnetization, susceptibility and of the correlation length close to the critical point. We find basically the same critical behavior as for the RFIM with delta-correlated disorder, except for the finite-size exponent of the susceptibility and for the case a=-1, where the results are also compatible with a phase transition at infinitesimal disorder strength. A summary of this work can be found at the papercore database at www.papercore.org.Comment: 9 pages, 13 figure

Interpolation and harmonic majorants in big Hardy-Orlicz spaces

Free interpolation in Hardy spaces is caracterized by the well-known Carleson condition. The result extends to Hardy-Orlicz spaces contained in the scale of classical Hardy spaces $H^p$, $p>0$. For the Smirnov and the Nevanlinna classes, interpolating sequences have been characterized in a recent paper in terms of the existence of harmonic majorants (quasi-bounded in the case of the Smirnov class). Since the Smirnov class can be regarded as the union over all Hardy-Orlicz spaces associated with a so-called strongly convex function, it is natural to ask how the condition changes from the Carleson condition in classical Hardy spaces to harmonic majorants in the Smirnov class. The aim of this paper is to narrow down this gap from the Smirnov class to ``big'' Hardy-Orlicz spaces. More precisely, we characterize interpolating sequences for a class of Hardy-Orlicz spaces that carry an algebraic structure and that are strictly bigger than $\bigcup_{p>0} H^p$. It turns out that the interpolating sequences are again characterized by the existence of quasi-bounded majorants, but now the weights of the majorants have to be in suitable Orlicz spaces. The existence of harmonic majorants in such Orlicz spaces will also be discussed in the general situation. We finish the paper with an example of a separated Blaschke sequence that is interpolating for certain Hardy-Orlicz spaces without being interpolating for slightly smaller ones.Comment: 19 pages, 2 figure

RNA secondary structure design

We consider the inverse-folding problem for RNA secondary structures: for a given (pseudo-knot-free) secondary structure find a sequence that has that structure as its ground state. If such a sequence exists, the structure is called designable. We implemented a branch-and-bound algorithm that is able to do an exhaustive search within the sequence space, i.e., gives an exact answer whether such a sequence exists. The bound required by the branch-and-bound algorithm are calculated by a dynamic programming algorithm. We consider different alphabet sizes and an ensemble of random structures, which we want to design. We find that for two letters almost none of these structures are designable. The designability improves for the three-letter case, but still a significant fraction of structures is undesignable. This changes when we look at the natural four-letter case with two pairs of complementary bases: undesignable structures are the exception, although they still exist. Finally, we also study the relation between designability and the algorithmic complexity of the branch-and-bound algorithm. Within the ensemble of structures, a high average degree of undesignability is correlated to a long time to prove that a given structure is (un-)designable. In the four-letter case, where the designability is high everywhere, the algorithmic complexity is highest in the region of naturally occurring RNA.Comment: 11 pages, 10 figure

Optimal Vertex Cover for the Small-World Hanoi Networks

The vertex-cover problem on the Hanoi networks HN3 and HN5 is analyzed with an exact renormalization group and parallel-tempering Monte Carlo simulations. The grand canonical partition function of the equivalent hard-core repulsive lattice-gas problem is recast first as an Ising-like canonical partition function, which allows for a closed set of renormalization group equations. The flow of these equations is analyzed for the limit of infinite chemical potential, at which the vertex-cover problem is attained. The relevant fixed point and its neighborhood are analyzed, and non-trivial results are obtained both, for the coverage as well as for the ground state entropy density, which indicates the complex structure of the solution space. Using special hierarchy-dependent operators in the renormalization group and Monte-Carlo simulations, structural details of optimal configurations are revealed. These studies indicate that the optimal coverages (or packings) are not related by a simple symmetry. Using a clustering analysis of the solutions obtained in the Monte Carlo simulations, a complex solution space structure is revealed for each system size. Nevertheless, in the thermodynamic limit, the solution landscape is dominated by one huge set of very similar solutions.Comment: RevTex, 24 pages; many corrections in text and figures; final version; for related information, see http://www.physics.emory.edu/faculty/boettcher

Skylab SO71/SO72 circadian periodicity experiment

The circadian rhythm hardware activities from 1965 through 1973 are considered. A brief history of the programs leading to the development of the combined Skylab SO71/SO72 Circadian Periodicity Experiment (CPE) is given. SO71 is the Skylab experiment number designating the pocket mouse circadian experiment, and SO72 designates the vinegar gnat circadian experiment. Final design modifications and checkout of the CPE, integration testing with the Apollo service module CSM 117 and the launch preparation and support tasks at Kennedy Space Center are reported

Quantum annealing with Jarzynski equality

We show a practical application of the Jarzynski equality in quantum computation. Its implementation may open a way to solve combinatorial optimization problems, minimization of a real single-valued function, cost function, with many arguments. We consider to incorpolate the Jarzynski equality into quantum annealing, which is one of the generic algorithms to solve the combinatorial optimization problem. The ordinary quantum annealing suffers from non-adiabatic transitions whose rate is characterized by the minimum energy gap $\Delta_{\rm min.}$ of the quantum system under consideration. The quantum sweep speed is therefore restricted to be extremely slow for the achievement to obtain a solution without relevant errors. However, in our strategy shown in the present study, we find that such a difficulty would not matter.Comment: 4 pages, to appear in Phys. Rev. Let

Supercharged topping rocket propellant feed system

A rocket propellant feed system utilizing a bleed turbopump to supercharge a topping turbopump is presented. The bleed turbopump is of a low pressure type to meet the cavitation requirements imposed by the propellant storage tanks. The topping turbopump is of a high pressure type and develops 60 to 70 percent of the pressure rise in the propellant

On Which Length Scales Can Temperature Exist in Quantum Systems?

We consider a regular chain of elementary quantum systems with nearest neighbor interactions and assume that the total system is in a canonical state with temperature $T$. We analyze under what condition the state factors into a product of canonical density matrices with respect to groups of $n$ subsystems each, and when these groups have the same temperature $T$. While in classical mechanics the validity of this procedure only depends on the size of the groups $n$, in quantum mechanics the minimum group size $n_{\text{min}}$ also depends on the temperature $T$! As examples, we apply our analysis to different types of Heisenberg spin chains.Comment: To appear in: Proceedings of the SPQS conference, J. Phys. Soc. Jpn. 74 (2005) Supp