A Geometric Monte Carlo Algorithm for the Antiferromagnetic Ising model with "Topological" Term at θ=π\theta=\pi

In this work we study the two and three-dimensional antiferromagnetic Ising model with an imaginary magnetic field $i\theta$ at $\theta=\pi$. In order to perform numerical simulations of the system we introduce a new geometric algorithm not affected by the sign problem. Our results for the $2D$ model are in agreement with the analytical solutions. We also present new results for the $3D$ model which are qualitatively in agreement with mean-field predictions

A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem

The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We introduce the cd-tree data structure and give a new characterization of c-planarity. It leads to efficient algorithms for c-planarity testing in the following cases. (i) Every cluster and every co-cluster (complement of a cluster) has at most two connected components. (ii) Every cluster has at most five outgoing edges. Moreover, the cd-tree reveals interesting connections between c-planarity and planarity with constraints on the order of edges around vertices. On one hand, this gives rise to a bunch of new open problems related to c-planarity, on the other hand it provides a new perspective on previous results.Comment: 17 pages, 2 figure

A Variational Formulation of Symplectic Noncommutative Mechanics

The standard lore in noncommutative physics is the use of first order variational description of a dynamical system to probe the space noncommutativity and its consequences in the dynamics in phase space. As the ultimate goal is to understand the inherent space noncommutativity we propose a variational principle for noncommutative dynamical systems in configuration space, based on results of our previous work [14]. We hope that this variational formulation in configuration space can be of help to elucidate the definition of some global and dynamical properties of classical and quantum noncommutative space.Comment: 17 pages, Latex. Accepted for publication in IJGMM

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.Comment: Accepted at GD '1

Positronium density measurements using polaritonic effects

Recent experimental advances in positronium (Ps) physics have made it possible to produce dense Ps ensembles in which Ps-Ps interactions may occur, leading to the production of Ps2 molecules and paving the way to the realization of a Ps Bose-Einstein condensate (BEC). In order to achieve this latter goal it would be advantageous to develop new methods to measure Ps densities in real time. Here we describe a possible approach to do this using polaritonic methods: Using realistic experimental parameters, we demonstrate that a dense Ps gas can be strongly coupled to the photonic field of a distributed Bragg reflector microcavity. In this strongly coupled regime, the optical spectrum of the system is composed of two hybrid positronium-polariton resonances separated by the vacuum Rabi splitting, which is proportional to the square root of the Ps density. Given that polaritons can be created on a subcycle timescale, a spectroscopic measurement of the vacuum Rabi splitting could be used as an ultrafast Ps density measurement in regimes relevant to Ps BEC formation. Moreover, we show how positronium polaritons could potentially enter the ultrastrong light-matter coupling regime, introducing a platform to explore its nonperturbative phenomenology

The GALEX Ultraviolet Virgo Cluster Survey (GUViCS). II. Constraints on star formation in ram-pressure stripped gas

Context: Several galaxies in the Virgo cluster are known to have large HI gas tails related to a recent ram-pressure stripping event. The Virgo cluster has been extensively observed at 1539 A in the far-ultraviolet for the GALEX Ultraviolet Virgo Cluster Survey (GUViCS), and in the optical for the Next Generation Virgo Survey (NGVS), allowing a study of the stellar emission potentially associated with the gas tails of 8 cluster members. On the theoretical side, models of ram-pressure stripping events have started to include the physics of star formation. Aim: We aim to provide quantitative constraints on the amount of star formation taking place in the ram-pressure stripped gas, mainly on the basis of the far-UV emission found in the GUViCS images in relation with the gas content of the tails. Methods: We have performed three comparisons of the young stars emission with the gas column density: visual, pixel-by-pixel and global. We have compared our results to other observational and theoretical studies. Results: We find that the level of star formation taking place in the gas stripped from galaxies by ram-pressure is low with respect to the available amount of gas. Star formation is lower by at least a factor 10 compared to the predictions of the Schmidt Law as determined in regular spiral galaxy disks. It is also lower than measured in dwarfs galaxies and the outer regions of spirals, and than predicted by some numerical simulations. We provide constraints on the star formation efficiency in the ram-pressure stripped gas tails, and compare these with current models.Comment: Accepted in A&A, 17 pages (including the appendix and "on-line" figures of the paper

CoPIRIDE : new technical expertise relating to the anionic polymerisation of 1,3-Butadiene

Abstract onl

Splitting Clusters To Get C-Planarity

In this paper we introduce a generalization of the c-planarity testing problem for clustered graphs. Namely, given a clustered graph, the goal of the S PLIT-C-P LANARITY problem is to split as few clusters as possible in order to make the graph c-planar. Determining whether zero splits are enough coincides with testing c-planarity. We show that S PLIT-C-P LANARITY is NP-complete for c-connected clustered triangulations and for non-c-connected clustered paths and cycles. On the other hand, we present a polynomial-time algorithm for flat c-connected clustered graphs whose underlying graph is a biconnected seriesparallel graph, both in the fixed and in the variable embedding setting, when the splits are assumed to maintain the c-connectivity of the clusters