The physics of twisted magnetic tubes rising in a stratified medium: two dimensional results

The physics of a twisted magnetic flux tube rising in a stratified medium is studied using a numerical MHD code. The problem considered is fully compressible (no Boussinesq approximation), includes ohmic resistivity, and is two dimensional, i.e., there is no variation of the variables in the direction of the tube axis. We study a high plasma beta case with small ratio of radius to external pressure scaleheight. The results obtained can therefore be of relevance to understand the transport of magnetic flux across the solar convection zone.Comment: To be published in ApJ, Vol. 492, Jan 10th, 1998; 25 pages, 16 figures. NEW VERSION: THE PREVIOUS ONE DIDN'T PRINT CORRECTLY. The style file overrulehere.sty is include

The Bose-Hubbard model on a triangular lattice with diamond ring-exchange

Ring-exchange interactions have been proposed as a possible mechanism for a Bose-liquid phase at zero temperature, a phase that is compressible with no superfluidity. Using the Stochastic Green Function algorithm (SGF), we study the effect of these interactions for bosons on a two-dimensional triangular lattice. We show that the supersolid phase, that is known to exist in the ground state for a wide range of densities, is rapidly destroyed as the ring-exchange interactions are turned on. We establish the ground-state phase diagram of the system, which is characterized by the absence of the expected Bose-liquid phase.Comment: 6 pages, 10 figure

Variable neighbourhood search for the minimum labelling Steiner tree problem

We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, an NP-hard graph problem related to the minimum labelling spanning tree problem. Given an undirected labelled connected graph, the aim is to find a spanning tree covering a given subset of nodes of the graph, whose edges have the smallest number of distinct labels. Such a model may be used to represent many real world problems in telecommunications and multimodal transportation networks. Several metaheuristics are proposed and evaluated. The approaches are compared to the widely adopted Pilot Method and it is shown that the Variable Neighbourhood Search that we propose is the most effective metaheuristic for the problem, obtaining high quality solutions in short computational running time