Some New Types of Well-Behaved Polynomial Redshift Parametrization of Dark Energy Equation of State
Prabir Rudra, Aritra Sanyal, Promila Biswas, Tuhina Ghorui, Ritabrata Biswas, Farook Rahaman

TL;DR
This paper introduces new well-behaved polynomial parametrizations of the dark energy equation of state, avoiding future singularities and improving constraints using observational data and machine learning techniques.
Contribution
It proposes novel polynomial-based dark energy models that are smooth and non-divergent, and evaluates their performance with observational data and machine learning methods.
Findings
Legendre polynomial basis showed best performance with lowest RMSE
New parametrizations provide tighter constraints on dark energy EoS
Models demonstrate improved physical accuracy and numerical stability
Abstract
In this paper, we explore a new type of smooth and well-behaved polynomial redshift function that can avoid a future singularity. Using this function, we have proposed different redshift parametrizations of the dark energy equation of state, drawing motivation from different polynomial functions like conventional polynomial, Legendre polynomial, Laguerre polynomial, Chebyshev polynomial and Fibonacci polynomial. The main feature of these parametrizations is their well-behaved nature throughout the evolution of the universe, which was a matter of concern in most of the previous polynomial parametrizations of the dark energy equation of state (EoS). This form of parametrization may be considered as an extension of those forms with no divergence at any redshift value. A comprehensive observational data analysis is performed with the Hubble, BAO and DESI datasets to constrain the parameter…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
