The difficult path to coalescence: massive black hole dynamics in merging low mass dark matter haloes and galaxies

Authors: Christian Partmann, Thorsten Naab, Antti Rantala, Anna Genina, Matias Mannerkoski, Peter H. Johansson

arXiv: 2310.08079v1 - DOI (astro-ph.GA)
22 pages, 15 figures
License: CC BY 4.0

Abstract: We present a high resolution numerical study of the sinking and merging of massive black holes (MBHs) with masses in the range of $10^3 - 10^7 \, \mathrm{M}_\odot$ in multiple minor mergers of low mass dark matter halos without and with galaxies ($4\times 10^8 \, \mathrm{M}_\odot \lesssim \mathrm{M}_{\mathrm{halo}} \lesssim 2\times 10^{10} \, \mathrm{M}_\odot)$. The Ketju simulation code, a combination of the Gadget tree solver with accurate regularised integration, uses unsoftened forces between the star/dark matter components and the MBHs for an accurate treatment of dynamical friction and scattering of dark matter/stars by MBH binaries or multiples. Post-Newtonian corrections up to order 3.5 for MBH interactions allow for coalescence by gravitational wave emission and gravitational recoil kicks. Low mass MBHs ($\lesssim 10^5 \, \mathrm{M}_\odot$) hardly sink to the centre or merge. Sinking MBHs have various complex evolution paths - binaries, triplets, free-floating MBHs, and dynamically or recoil ejected MBHs. Collisional interactions with dark matter alone can drive MBHs to coalescence. The highest mass MBHs of $\gtrsim 10^6 M_\odot$ mostly sink to the centre and trigger the scouring of dark matter and stellar cores. The scouring can transform a centrally baryon dominated system to a dark matter dominated system. Our idealized high-resolution study highlights the difficulty to bring in and keep low mass MBHs in the centres of low mass halos/galaxies - a remaining challenge for merger assisted MBH seed growth mechanisms.

Submitted to arXiv on 12 Oct. 2023

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.