A polynomial bound for untangling geometric planar graphs

To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while keeping at least n^\epsilon vertices fixed. We answer this question in the affirmative with \epsilon=1/4. The previous best known bound was \Omega((\log n / \log\log n)^{1/2}). We also consider untangling geometric trees. It is known that every n-vertex geometric tree can be untangled while keeping at least (n/3)^{1/2} vertices fixed, while the best upper bound was O(n\log n)^{2/3}. We answer a question of Spillner and Wolff [arXiv:0709.0170 2007] by closing this gap for untangling trees. In particular, we show that for infinitely many values of n, there is an n-vertex geometric tree that cannot be untangled while keeping more than 3(n^{1/2}-1) vertices fixed. Moreover, we improve the lower bound to (n/2)^{1/2}.Comment: 14 pages, 7 figure

Feasible combinatorial matrix theory

We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory \LA with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over the standard textbook proof of KMM which requires $\Pi_2^B$ induction, and hence does not yield feasible proofs --- while our new approach does. \LA is a weak theory that essentially captures the ring properties of matrices; however, equipped with $\Sigma_1^B$ induction \LA is capable of proving KMM, and a host of other combinatorial properties such as Menger's, Hall's and Dilworth's Theorems. Therefore, our result formalizes Min-Max type of reasoning within a feasible framework

Axiomatizations of two types of Shapley values for games on union closed systems

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the Shapley value. In the literature various models of games with restricted cooperation can be found. So, instead of allowing all subsets of the player set N to form, it is assumed that the set of feasible coalitions is a subset of the power set of N. In this paper, we consider such sets of feasible coalitions that are closed under union, i.e. for any two feasible coalitions also their union is feasible. We consider and axiomatize two solutions or rules for these games that generalize the Shapley value: one is obtained as the conjunctive permission value using a corresponding superior graph, the other is defined as the Shapley value of a modified game similar as the Myerson value for games with limited communication. © 2010 The Author(s)

Advanced brain dopamine transporter imaging in mice using small-animal SPECT/CT

Abstract. The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum size, while any stable matching is a maximal matching and thus trivially a factor two approximation. In this paper, we give the first nontrivial result for approximation of factor less than two. Our algorithm achieves an approximation ratio of 2/(1+L −2) for instances in which only men have ties of length at most L. When both men and women are allowed to have ties, we show a ratio of 13/7(< 1.858) for the case when ties are of length two. We also improve the lower bound on the approximation ratio to 2

Convexity in partial cubes: the hull number

We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some earlier results in the literature. On the other hand we provide a polynomial-time algorithm to determine the hull number of planar partial cube quadrangulations. Instances of the hull number problem for partial cubes described include poset dimension and hitting sets for interiors of curves in the plane. To obtain the above results, we investigate convexity in partial cubes and characterize these graphs in terms of their lattice of convex subgraphs, improving a theorem of Handa. Furthermore we provide a topological representation theorem for planar partial cubes, generalizing a result of Fukuda and Handa about rank three oriented matroids.Comment: 19 pages, 4 figure

The model legume Medicago truncatula A17 is poorly matched for N2fixation with the sequenced microsymbiont Sinorhizobium meliloti 1021

Medicago truncatula (barrel medic) A17 is currently being sequenced as a model legume, complementing the sequenced root nodule bacterial strain Sinorhizobium meliloti 1021 (Sm1021). In this study, the effectiveness of the Sm1021-M. truncatula symbiosis at fixing N2 was evaluated. • N2 fixation effectiveness was examined with eight Medicago species and three accessions of M. truncatula with Sm1021 and two other Sinorhizobium strains. Plant shoot dry weights, plant nitrogen content and nodule distribution, morphology and number were analysed. • Compared with nitrogen-fed controls, Sm1021 was ineffective or partially effective on all hosts tested (excluding M. sativa), as measured by reduced dry weights and shoot N content. Against an effective strain, Sm1021 on M. truncatula accessions produced more nodules, which were small, pale, more widely distributed on the root system and with fewer infected cells. • The Sm1021-M. truncatula symbiosis is poorly matched for N2 fixation and the strain could possess broader N2 fixation deficiencies. A possible origin for this reduction in effectiveness is discussed. An alternative sequenced strain, effective at N2 fixation on M. truncatula A17, is Sinorhizobium medicae WSM419