1.8k citations
- International Solvay InstitutesBE72 papers
- Centre National de la Recherche ScientifiqueFR56 papers
- KU LeuvenBE20 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR17 papers
- Université Paris-SudFR15 papers
- Vrije Universiteit BrusselBE15 papers
- University of MonsBE14 papers
- Utrecht UniversityNL14 papers
- University of St AndrewsGB13 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR12 papers
- Joint Institute for Nuclear ResearchRU12 papers
- University of BonnDE12 papers
69 papers · 1 filter
A unique decay process: beta delayed emission of a proton and a neutron by the Li halo nucleus
D. Baye, P. Descouvemont, E. M. Tursunov
The neutron-rich Li halo nucleus is unique among nuclei with known separation energies by its ability to emit a proton and a neutron in a decay process. The branching ra…
Self-interaction errors in nuclear energy density functionals
N. Chamel
When applied to a single nucleon, nuclear energy density functionals may yield a non-vanishing internal energy thus implying that the nucleon is interacting with itself. It is show…
On the stability of particle dark matter
Thomas Hambye
From the particle physics point of view, the most peculiar property of the dark matter particle is its stability on cosmological time scales. We briefly review the possible origins…
Maximally Supersymmetric Yang-Mills in five dimensions in light-cone superspace
Lars Brink, Sung-Soo Kim
We formulate maximally supersymmetric Yang-Mills theory in five dimensions in light-cone superspace. The light-cone Hamiltonian is of the quadratic form and the theory can be under…
Approximating Vertex Cover in Dense Hypergraphs
Jean Cardinal, Marek Karpinski, Richard Schmied +1
We consider the minimum vertex cover problem in hypergraphs in which every hyperedge has size k (also known as minimum hitting set problem, or minimum set cover with element freque…
Contracting planar graphs to contractions of triangulations
Marcin Kaminski, Daniel Paulusma, Dimitrios M. Thilikos
For every graph , there exists a polynomial-time algorithm deciding if a planar input graph can be contracted to~. However, the degree of the polynomial depends on the si…