Vortex Rings in Fast Rotating Bose-Einstein Condensates

When Bose-Eintein condensates are rotated sufficiently fast, a giant vortex phase appears, that is the condensate becomes annular with no vortices in the bulk but a macroscopic phase circulation around the central hole. In a former paper [M. Correggi, N. Rougerie, J. Yngvason, {\it arXiv:1005.0686}] we have studied this phenomenon by minimizing the two dimensional Gross-Pitaevskii energy on the unit disc. In particular we computed an upper bound to the critical speed for the transition to the giant vortex phase. In this paper we confirm that this upper bound is optimal by proving that if the rotation speed is taken slightly below the threshold there are vortices in the condensate. We prove that they gather along a particular circle on which they are evenly distributed. This is done by providing new upper and lower bounds to the GP energy.Comment: to appear in Archive of Rational Mechanics and Analysi

Gauge invariant derivative expansion of the effective action at finite temperature and density and the scalar field in 2+1 dimensions

A method is presented for the computation of the one-loop effective action at finite temperature and density. The method is based on an expansion in the number of spatial covariant derivatives. It applies to general background field configurations with arbitrary internal symmetry group and space-time dependence. Full invariance under small and large gauge transformations is preserved without assuming stationary or Abelian fields nor fixing the gauge. The method is applied to the computation of the effective action of spin zero particles in 2+1 dimensions at finite temperature and density and in presence of background gauge fields. The calculation is carried out through second order in the number of spatial covariant derivatives. Some limiting cases are worked out.Comment: 34 pages, REVTEX, no figures. Further comments adde

Off-line admission control for advance reservations in star networks

Given a network together with a set of connection requests, call admission control is the problem of deciding which calls to accept and which ones to reject in order to maximize the total profit of the accepted requests. We consider call admission control problems with advance reservations in star networks. For the most general variant we present a constant-factor approximation algorithm resolving an open problem due to Erlebach. Our method is randomized and achieves an approximation ratio of 1/18. It can be generalized to accommodate call alternatives, in which case the approximation ratio is 1/24. We show how our method can be derandomized. In addition we prove that call admission control in star networks is -hard even for very restricted variants of the problem