First galaxy ultraviolet luminosity function limits on dark matter-proton scattering
Authors: Hovav Lazare, Ely D. Kovetz, Kimberly K. Boddy, Julian B. Munoz
Abstract: Scattering between dark matter (DM) and protons leads to suppressed small-scale fluctuations, with implications for a variety of cosmological observables. In this work, we search for evidence of DM-proton scattering with an interaction cross section $σ\!=\!σ_0 (\frac{v}{c})^n$ for $n=0,2$ and $4$, corresponding e.g. to velocity-independent contact interactions from heavy mediators, velocity-dependent pseudoscalar-mediated scattering, and higher-order dipole interactions, respectively, using high-redshift ($z \sim4-10$) ultraviolet galaxy luminosity functions (UVLFs) observed by Hubble Space Telescope (HST). We employ an adjusted implementation of GALLUMI combined with the modified Boltzmann solver CLASS DMeff that accounts for interacting DM, and incorporate UVLF data from both blank and lensed HST fields, alongside Planck CMB data and the Pantheon supernova catalog in a Bayesian analysis framework to set constraints on $σ_0$. Our results show that including lensed UVLF data, which probe fainter galaxies than the blank HST fields and thus smaller scales, leads to a substantial improvement in the constraints on $σ_0$ for $n>0$, surpassing existing bounds from Milky-Way (MW) satellite abundance and CMB anisotropies. For $m_χ = 1\,\rm MeV $, for example, we set the upper bounds at $8.3\times 10^{-26} \, \rm cm^2$ for $n=2$ and $1.2\times 10^{-22} \, \rm cm^2$ for $n=4$. For $n=0$, our bound is within an order of magnitude of those from the Lyman-$α$ forest and MW satellites.
Explore the paper tree
Click on the tree nodes to be redirected to a given paper and access their summaries and virtual 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.