Gap carving by a migrating planet embedded in a massive debris disc

Authors: Marc F. Friebe, Tim D. Pearce, Torsten Löhne

arXiv: 2203.03611v1 - DOI (astro-ph.EP)
15 pages, 10 figures, accepted for publication in MNRAS
License: CC BY 4.0

Abstract: When considering gaps in debris discs, a typical approach is to invoke clearing by an unseen planet within the gap, and derive the planet mass using Wisdom overlap or Hill radius arguments. However, this approach can be invalid if the disc is massive, because this clearing would also cause planet migration. This could result in a calculated planet mass that is incompatible with the inferred disc mass, because the predicted planet would in reality be too small to carve the gap without significant migration. We investigate the gap that a single embedded planet would carve in a massive debris disc. We show that a degeneracy is introduced, whereby an observed gap could be carved by two different planets: either a high-mass, barely-migrating planet, or a smaller planet that clears debris as it migrates. We find that, depending on disc mass, there is a minimum possible gap width that an embedded planet could carve (because smaller planets, rather than carving a smaller gap, would actually migrate through the disc and clear a wider region). We provide simple formulae for the planet-to-debris disc mass ratio at which planet migration becomes important, the gap width that an embedded planet would carve in a massive debris disc, and the interaction timescale. We also apply our results to various systems, and in particular show that the disc of HD 107146 can be reasonably well-reproduced with a migrating, embedded planet. Finally, we discuss the importance of planet-debris disc interactions as a tool for constraining debris disc masses.

Submitted to arXiv on 07 Mar. 2022

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.