Strong bound on canonical ultra-light axion dark matter from the Lyman-alpha forest
Authors: Keir K. Rogers, Hiranya V. Peiris
AI-generated Key Points
- Keir K. Rogers and Hiranya V. Peiris present a new bound on the mass of ultra-light axion (ULA) dark matter using the Lyman-alpha forest to look for suppressed cosmic structure growth.
- The authors report a 95% lower limit of $m_\text{a} > 2 \times 10^{-20}\,\text{eV}$, which strongly disfavors the canonical ULA with $10^{-22}\,\text{eV} < m_\text{a} < 10^{-21}\,\text{eV}$ at over 99.7% credibility.
- The authors strengthen previous equivalent bounds by about an order of magnitude, demonstrating the robustness of their results using an optimized emulator based on improved hydrodynamical simulations.
- The Lyman-alpha forest is a powerful tool for probing cosmological structures at high redshifts, making it well suited for studying dark matter candidates like ULAs.
- ULAs are a promising candidate for explaining some long-standing problems in cosmology but this work suggests that they may not be as viable as previously thought.
- This study has important implications for our understanding of dark matter and its properties.
- Further research will be needed to confirm these findings and explore other potential explanations for dark matter's nature and behavior.
Abstract: We present a new bound on the ultra-light axion (ULA) dark matter mass $m_\text{a}$, using the Lyman-alpha forest to look for suppressed cosmic structure growth: a 95% lower limit $m_\text{a} > 2 \times 10^{-20}\,\text{eV}$. This strongly disfavors ($> 99.7\%$ credibility) the canonical ULA with $10^{-22}\,\text{eV} < m_\text{a} < 10^{-21}\,\text{eV}$, motivated by the string axiverse and solutions to possible tensions in the cold dark matter model. We strengthen previous equivalent bounds by about an order of magnitude. We demonstrate the robustness of our results using an optimized emulator of improved hydrodynamical simulations.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.