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

Auteurs : 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
Licence : CC BY 4.0

Résumé : 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.

Soumis à arXiv le 07 Mar. 2022

Explorez l'arbre d'article

Cliquez sur les nœuds de l'arborescence pour être redirigé vers un article donné et accéder à leurs résumés et assistant virtuel

Accédez également à nos Résumés, ou posez des questions sur cet article à notre Assistant IA.

Recherchez des articles similaires (en version bêta)

En cliquant sur le bouton ci-dessus, notre algorithme analysera tous les articles de notre base de données pour trouver le plus proche en fonction du contenu des articles complets et pas seulement des métadonnées. Veuillez noter que cela ne fonctionne que pour les articles pour lesquels nous avons généré des résumés et que vous pouvez le réexécuter de temps en temps pour obtenir un résultat plus précis pendant que notre base de données s'agrandit.