The structure of N=2 supersymmetric nonlinear sigma models in AdS_4

We present a detailed study of the most general N=2 supersymmetric sigma models in four-dimensional anti-de Sitter space AdS_4 formulated in terms of N=1 chiral superfields. The target space is demonstrated to be a non-compact hyperkahler manifold restricted to possess a special Killing vector field which generates an SO(2) group of rotations on the two-sphere of complex structures and necessarily leaves one of them invariant. All hyperkahler cones, that is the target spaces of N=2 superconformal sigma models, prove to possess such a vector field that belongs to the Lie algebra of an isometry group SU(2) acting by rotations on the complex structures. A unique property of the N=2 sigma models constructed is that the algebra of OSp(2|4) transformations closes off the mass shell. We uncover the underlying N=2 superfield formulation for the N=2 sigma models constructed and compute the associated N=2 supercurrent. We give a special analysis of the most general systems of self-interacting N=2 tensor multiplets in AdS_4 and their dual sigma models realized in terms of N=1 chiral multiplets. We also briefly discuss the relationship between our results on N=2 supersymmetric sigma models formulated in the N=1 AdS superspace and the off-shell sigma models constructed in the N=2 AdS superspace in arXiv:0807.3368.Comment: 84 pages; v2: typos corrected, version published in JHE

Effect of sitagliptin on cardiovascular outcomes in type 2 diabetes

BACKGROUND: Data are lacking on the long-term effect on cardiovascular events of adding sitagliptin, a dipeptidyl peptidase 4 inhibitor, to usual care in patients with type 2 diabetes and cardiovascular disease. METHODS: In this randomized, double-blind study, we assigned 14,671 patients to add either sitagliptin or placebo to their existing therapy. Open-label use of antihyperglycemic therapy was encouraged as required, aimed at reaching individually appropriate glycemic targets in all patients. To determine whether sitagliptin was noninferior to placebo, we used a relative risk of 1.3 as the marginal upper boundary. The primary cardiovascular outcome was a composite of cardiovascular death, nonfatal myocardial infarction, nonfatal stroke, or hospitalization for unstable angina. RESULTS: During a median follow-up of 3.0 years, there was a small difference in glycated hemoglobin levels (least-squares mean difference for sitagliptin vs. placebo, -0.29 percentage points; 95% confidence interval [CI], -0.32 to -0.27). Overall, the primary outcome occurred in 839 patients in the sitagliptin group (11.4%; 4.06 per 100 person-years) and 851 patients in the placebo group (11.6%; 4.17 per 100 person-years). Sitagliptin was noninferior to placebo for the primary composite cardiovascular outcome (hazard ratio, 0.98; 95% CI, 0.88 to 1.09; P<0.001). Rates of hospitalization for heart failure did not differ between the two groups (hazard ratio, 1.00; 95% CI, 0.83 to 1.20; P = 0.98). There were no significant between-group differences in rates of acute pancreatitis (P = 0.07) or pancreatic cancer (P = 0.32). CONCLUSIONS: Among patients with type 2 diabetes and established cardiovascular disease, adding sitagliptin to usual care did not appear to increase the risk of major adverse cardiovascular events, hospitalization for heart failure, or other adverse events

Covering with Clubs: Complexity and Approximability

Lecture Notes in Computer Science book series (LNCS, volume 10979)Finding cohesive subgraphs in a network is a well-known problem in graph theory. Several alternative formulations of cohesive subgraph have been proposed, a notable example being s-club, which is a subgraph where each vertex is at distance at most s to the others. Here we consider the problem of covering a given graph with the minimum number of s-clubs. We study the computational and approximation complexity of this problem, when s is equal to 2 or 3. First, we show that deciding if there exists a cover of a graph with three 2-clubs is NP-complete, and that deciding if there exists a cover of a graph with two 3-clubs is NP-complete. Then, we consider the approximation complexity of covering a graph with the minimum number of 2-clubs and 3-clubs. We show that, given a graph G=(V,E) to be covered, covering G with the minimum number of 2-clubs is not approximable within factor O(|V|1/2−ε), for any ε>0, and covering G with the minimum number of 3-clubs is not approximable within factor O(|V|1−ε), for any ε>0. On the positive side, we give an approximation algorithm of factor 2|V|1/2log3/2|V| for covering a graph with the minimum number of 2-clubs