Phosphorus is regarded as the best substitutional donor for n-type diamonds. However, because of vacancy-related complexes, H-related and other defects in P-doped diamonds, obtaining diamonds with satisfying properties challenging. In this report, PV PVH complexes are studied detail using density function theory (DFT). The formation energy reveals possibility emergency these when doping a singl...

Abstract We present a proof of a conjecture about the relationship between Baxter permutations and pairs of alternating sign matrices that are produced from domino tilings of Aztec diamonds. It is shown that a tiling corresponds to a pair of ASMs that are both permutation matrices if and only if the larger permutation matrix corresponds to a Baxter permutation. There has been a thriving literat...

A recurrent pattern in the representation of actions and processes is the notion of exchange. It is a concept primarily characterised by a structure of processes or actions, rather than inherent properties, but has a strong ontological flavour. Exchange is furthermore governed by reciprocity, reflected by the way in which roles are constrained. Representing exchange and other structured objects...

In this paper we study the complexity of the (weighted) maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. In this problem, one is given a collection of weighted constraints on overlapping sets of variables, and the goal is to find an assignment of values to the variables so as to maximize the total weight of satisfied constraints. Max Cut is a typical example of...

We consider the following NP-hard problem: in a weighted graph, find a minimum cost set of vertices whose removal leaves a graph in which no two cycles share an edge. We obtain a constant-factor approximation algorithm, based on the primaldual method. Moreover, we show that the integrality gap of the natural LP relaxation of the problem is Θ(logn), where n denotes the number of vertices in the ...

Matthijs Westera Adrian Brasoveanu ILLC, University of Amsterdam UC Santa Cruz I. The phenomena. Geurts & Nouwen (2007) report a contrast between superlative modifiers (henceforth Sups) like at most, and comparative modifiers (henceforth Comps) like less than: only sups license an ignorance inference. For instance, (1a) but not (1b) conveys that the speaker doesn’t know the exact number of diam...