In this paper we consider stable matchings that are subject to assignment constraints. These require certain assigned pairs be included, insist some other not, and, importantly, stable. Our main contribution is an algorithm determines when constraints compatible with stability. Whenever a matching consistent the exists, our will output all of them (in polynomial time per solution). This provide...

Using one of the key property of copulas that they remain invariant under an arbitrary monotonous change of variable, we investigate the null hypothesis that the dependence between financial assets can be modeled by the Gaussian copula. We find that most pairs of currencies and pairs of major stocks are compatible with the Gaussian copula hypothesis, while this hypothesis can be rejected for th...

We consider the braiding of Kramers pairs of Majorana bound states. We derive the most general transformation on the many-body ground state that is applied as the result of such a braiding process. The result is derived in the context of a toy model, but we will show that it has the most general form that is compatible with local and global conservation of electron parity. In accordance with ea...

We consider a model of Paired Kidney Exchange (PKE) with feasibility con-straints on the number of patient-donor pairs involved in exchanges. Patients’preferences are restricted so that patients prefer kidneys from compatible youngerdonors to kidneys from older donors. In this framework, patients with compati-ble donors may enroll on PKE programs to receive an organ with higher ...

Magarshak et al. represented an RNA molecule as a complex vector x and an RNA secondary structure gamma as a complex matrix Sgamma in such a way that the molecule represented by x was compatible with the secondary structure gamma if and only if Sgamma o x=x. They only considered Watson-Crick base pairs and their representation cannot be extended to allow for G x U pairs. In this paper we study ...

In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a well-deened product behavior are ruled out. They can be ruled out semantically, by insisting on the existence of certain xed points, or syntactically, by equipping processes with types, which make the dependencies between input and output signals transparent. We cla...

4 CAGEr workflow 6 4.1 Specifying input files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Creating CAGEset object . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.3 Reading in the data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.4 Correlation between samples . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.5 Normalization . . . . . . . . . ....