The Codimension-Three conjecture for holonomic DQ-modules

We prove an analogue for holonomic DQ-modules of the codimension-three conjecture for microdifferential modules recently proved by Kashiwara and Vilonen. Our result states that any holonomic DQ-module having a lattice extends uniquely beyond an analytic subset of codimension equal to or larger than three in a Lagrangian subvariety containing the support of the DQ-module.Comment: 37 pages, several minor correction

DG Affinity of DQ-modules

In this paper, we prove the dg affinity of formal deformation algebroid stacks over complex smooth algebraic varieties. For that purpose, we introduce the triangulated category of formal deformation modules which are cohomologically complete and whose associated graded module is quasi-coherent.Comment: 21 pages, references adde

Tempered subanalytic topology on algebraic varieties

On a smooth algebraic variety over $\mathbb{C}$, we build the tempered subanalytic and Stein tempered subanalytic sites. We construct the sheaf of holomorphic functions tempered at infinity over these sites and study their relations with the sheaf of regular functions, proving in particular that these sheaves are isomorphic on Zariski open subsets. We show that these data allow to define the functors of tempered and Stein tempered analytifications. We study the relations between these two functors and the usual analytification functor. We also obtain algebraization results in the non-proper case and flatness results.Comment: 24 pages. Preliminary version. Comments are welcom

Hamiltonian cycles in faulty random geometric networks

In this paper we analyze the Hamiltonian properties of faulty random networks. This consideration is of interest when considering wireless broadcast networks. A random geometric network is a graph whose vertices correspond to points uniformly and independently distributed in the unit square, and whose edges connect any pair of vertices if their distance is below some specified bound. A faulty random geometric network is a random geometric network whose vertices or edges fail at random. Algorithms to find Hamiltonian cycles in faulty random geometric networks are presented.Postprint (published version

Michel Henon, a playfull and simplifying mind

Several chapters in this book present various aspects of Michel Henon's scientific acheivements that spread over a large range of subjects, and yet managed to make deep contributions to most of them. The authors of these chapters make a much better job at demonstrating the big advancements that Michel Henon allowed in these fields than I could ever do. Here I rather present some facets of his personnality that most appealed to me. Michel Henon was a reserved person, almost shy, so it was not obvious for a young student to grasp the profoundness of his insight and what a marvelous advisor he could be. The two most prominent aspects of his mind, in my view, were his ability to simplify any scientific question to its core complexity, and to find the fun and amusing part in his everyday work, even in the tiniest details of his scientific investigations.Comment: Invited talk at the "hommage a Michel Henon" conference held at the "Institut Henri Poincare" Paris, GRAVASCO trimestre, autumn 2013. Proceeding by Hermann Press, editors: Jean-Michel Alimi, Roya Mohayaee, Jerome Perez. Videos of all talks are available at: https://www.youtube.com/playlist?list=PL9kd4mpdvWcBLrN8u04IZW6-akNgLG7-

Combining spectral sequencing and parallel simulated annealing for the MinLA problem

In this paper we present and analyze new sequential and parallel heuristics to approximate the Minimum Linear Arrangement problem (MinLA). The heuristics consist in obtaining a first global solution using Spectral Sequencing and improving it locally through Simulated Annealing. In order to accelerate the annealing process, we present a special neighborhood distribution that tends to favor moves with high probability to be accepted. We show how to make use of this neighborhood to parallelize the Metropolis stage on distributed memory machines by mapping partitions of the input graph to processors and performing moves concurrently. The paper reports the results obtained with this new heuristic when applied to a set of large graphs, including graphs arising from finite elements methods and graphs arising from VLSI applications. Compared to other heuristics, the measurements obtained show that the new heuristic improves the solution quality, decreases the running time and offers an excellent speedup when ran on a commodity network made of nine personal computers.Postprint (published version

Spin dynamics and structure formation in a spin-1 condensate in a magnetic field

We study the dynamics of a trapped spin-1 condensate in a magnetic field. First, we analyze the homogeneous system, for which the dynamics can be understood in terms of orbits in phase space. We analytically solve for the dynamical evolution of the populations of the various Zeeman components of the homogeneous system. This result is then applied via a local-density approximation to trapped quasi-one-dimensional condensates. Our analysis of the trapped system in a magnetic field shows that both the mean-field and Zeeman regimes are simultaneously realized, and we argue that the border between these two regions is where spin domains and phase defects are generated. We propose a method to experimentally tune the position of this border