Chiral three-nucleon forces and bound excited states in neutron-rich oxygen isotopes

We study the spectra of neutron-rich oxygen isotopes based on chiral two- and three-nucleon interactions. First, we benchmark our many-body approach by comparing ground-state energies to coupled-cluster results for the same two-nucleon interaction, with overall good agreement. We then calculate bound excited states in 21,22,23O, focusing on the role of three-nucleon forces, in the standard sd shell and an extended sdf7/2p3/2 valence space. Chiral three-nucleon forces provide important one- and two-body contributions between valence neutrons. We find that both these contributions and an extended valence space are necessary to reproduce key signatures of novel shell evolution, such as the N = 14 magic number and the low-lying states in 21O and 23O, which are too compressed with two-nucleon interactions only. For the extended space calculations, this presents first work based on nuclear forces without adjustments. Future work is needed and open questions are discussed.Comment: 6 pages, 4 figures, published versio

Reconfiguration of Cliques in a Graph

We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider three different types of rules, which are defined and studied in reconfiguration problems for independent sets. We first prove that all the three rules are equivalent in cliques. We then show that the problems are PSPACE-complete for perfect graphs, while we give polynomial-time algorithms for several classes of graphs, such as even-hole-free graphs and cographs. In particular, the shortest variant, which computes the shortest length of a desired sequence, can be solved in polynomial time for chordal graphs, bipartite graphs, planar graphs, and bounded treewidth graphs

On cycle transversals and their connected variants in the absence of a small linear forest.

A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity results for the two classical cycle transversal problems Feedback Vertex Set and Odd Cycle Transversal by showing that they can be solved in polynomial time for (sP1+P3) -free graphs for every integer s≥1 . We show the same result for the variants Connected Feedback Vertex Set and Connected Odd Cycle Transversal. For the latter two problems we also prove that they are polynomial-time solvable for cographs; this was known already for Feedback Vertex Set and Odd Cycle Transversal

HCV IRES manipulates the ribosome to promote the switch from translation initiation to elongation.

The internal ribosome entry site (IRES) of the hepatitis C virus (HCV) drives noncanonical initiation of protein synthesis necessary for viral replication. Functional studies of the HCV IRES have focused on 80S ribosome formation but have not explored its role after the 80S ribosome is poised at the start codon. Here, we report that mutations of an IRES domain that docks in the 40S subunit's decoding groove cause only a local perturbation in IRES structure and result in conformational changes in the IRES-rabbit 40S subunit complex. Functionally, the mutations decrease IRES activity by inhibiting the first ribosomal translocation event, and modeling results suggest that this effect occurs through an interaction with a single ribosomal protein. The ability of the HCV IRES to manipulate the ribosome provides insight into how the ribosome's structure and function can be altered by bound RNAs, including those derived from cellular invaders

The nuclear energy density functional formalism

The present document focuses on the theoretical foundations of the nuclear energy density functional (EDF) method. As such, it does not aim at reviewing the status of the field, at covering all possible ramifications of the approach or at presenting recent achievements and applications. The objective is to provide a modern account of the nuclear EDF formalism that is at variance with traditional presentations that rely, at one point or another, on a {\it Hamiltonian-based} picture. The latter is not general enough to encompass what the nuclear EDF method represents as of today. Specifically, the traditional Hamiltonian-based picture does not allow one to grasp the difficulties associated with the fact that currently available parametrizations of the energy kernel $E[g',g]$ at play in the method do not derive from a genuine Hamilton operator, would the latter be effective. The method is formulated from the outset through the most general multi-reference, i.e. beyond mean-field, implementation such that the single-reference, i.e. "mean-field", derives as a particular case. As such, a key point of the presentation provided here is to demonstrate that the multi-reference EDF method can indeed be formulated in a {\it mathematically} meaningful fashion even if $E[g',g]$ does {\it not} derive from a genuine Hamilton operator. In particular, the restoration of symmetries can be entirely formulated without making {\it any} reference to a projected state, i.e. within a genuine EDF framework. However, and as is illustrated in the present document, a mathematically meaningful formulation does not guarantee that the formalism is sound from a {\it physical} standpoint. The price at which the latter can be enforced as well in the future is eventually alluded to.Comment: 64 pages, 8 figures, submitted to Euroschool Lecture Notes in Physics Vol.IV, Christoph Scheidenberger and Marek Pfutzner editor

A polynomial turing-Kernel for weighted independent set in bull-free graphs

The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size k, when k is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm when we parameterize the problem by the solution size k. A polynomial kernel is unlikely to exist for this problem. We show however that our problem has a polynomial size Turing-kernel. More precisely, the hard cases are instances of size O(k5). All our results rely on a decomposition theorem of bull-free graphs due to Chudnovsky which is modified here, allowing us to provide extreme decompositions, adapted to our computational purpose

High Potential of a Transposon mPing as a Marker System in japonica × japonica Cross in Rice

Although quantitative traits loci (QTL) analysis has been widely performed to isolate agronomically important genes, it has been difficult to obtain molecular markers between individuals with similar phenotypes (assortative mating). Recently, the miniature inverted-repeat transposable element mPing was shown to be active in the japonica strain Gimbozu EG4 where it had accumulated more than 1000 copies. In contrast, most other japonicas, including Nipponbare, have 50 or fewer mPing insertions in their genome. In this study we have exploited the polymorphism of mPing insertion sites to generate 150 PCR markers in a cross between the closely related japonicas, Nipponbare × Gimbozu (EG4). These new markers were distributed in genic regions of the whole genome and showed significantly higher polymorphism (150 of 183) than all other molecular markers tested including short sequence repeat markers (46 of 661). In addition, we performed QTL analysis with these markers using recombinant inbred lines derived from Nipponbare × Gimbozu EG4, and successfully mapped a locus involved in heading date on the short arm of chromosome 6. Moreover, we could easily map two novel loci involved in the culm length on the short arms of chromosomes 3 and 10