2 papers
math.CO2025
Chromatic number of random graphs: an approach using a recurrence relation
Yayoi Abe, Auna Setoh, Gen Yoneda
The vertex coloring problem to find chromatic numbers is known to be unsolvable in polynomial time. Although various algorithms have been proposed to efficiently compute chromatic…
gr-qc2024
Stability analysis and improvement of the covariant BSSN formulation against the FLRW spacetime background
Hidetomo Hoshino, Takuya Tsuchiya, Gen Yoneda
In this study, we investigate the numerical stability of the covariant Baumgarte--Shapiro--Shibata--Nakamura (cBSSN) formulation against the Friedmann--Lemaître--Robertson--Walker…