The cover polynomial introduced by Chung and Graham is a twovariate graph polynomial for directed graphs. It counts the (weighted) number of ways to cover a graph with disjoint directed cycles and paths, it is an interpolation between determinant and permanent, and it is believed to be a directed analogue of the Tutte polynomial. Jaeger, Vertigan, and Welsh showed that the Tutte polynomial is #...

Various radio observations have shown that the hot atmospheres of galaxy clusters are magnetized. However, our understanding of the origin of these magnetic fields, their implications on structure formation and their interplay with the dynamics of the cluster atmosphere, especially in the centers of galaxy clusters, is still very limited. In preparation for the upcoming new generation of radio ...

Many-body entangled systems, in particular topologically ordered spin systems proposed as resources for quantum information processing tasks, often involve highly nonlocal interaction terms. While one may approximate such systems through two-body interactions perturbatively, these approaches have a number of drawbacks in practice. In this Letter, we propose a scheme to simulate many-body spin H...

In this paper, we consider properly edge-coloured (PC) paths and cycles in edge-coloured graphs. We consider a family of transformations of an edge-coloured graph G into an ordinary graph that allow us to check the existence PC cycles and PC (s, t)-paths in G and, if they exist, to find shortest ones among them. We raise a problem of finding the optimal transformation and consider a possible so...

Pif Gadget est un journal marqué par l’idéologie communiste. Possédé des groupes rattachés au Parti communiste français, on retrouve dans les bandes dessinées, gadgets ou le rédactionnel du magazine traces de cette influence. De manière plus étonnante, ce contenu aussi parfois en avance, voire rupture, avec la doctrine parti, et accompagne l’évolution public rapport aux questions environnementa...

We demonstrate that automated, architecture-independent gadget search is possible. Gadgets are code fragments which can be used to build unintended programs from existing code in memory. Our contribution is a framework of algorithms capable of locating a Turing-complete gadget set. Translating machine code into an intermediate language allows our framework to be used for many different CPU arch...

In this paper we show how model transformations can be used to describe and automatize component design process throught an example of a communication component. Automatizing parts of the design with transformations allows to trace the design, defend such or such design choice and build non functional variants of the same component.