Challenges to the assessment of time-to-proof of mathematical conjectures

DOI10.1007/S00283-013-9383-7zbMath1316.62059arXiv1202.3936OpenAlexW3103984397WikidataQ122928054 ScholiaQ122928054MaRDI QIDQ393479

Ryohei Hisano, Didier Sornette

Publication date: 23 January 2014

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3936

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30)

Related Items (1)

Logical probability and the strength of mathematical conjectures

Cites Work

• Unnamed Item
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Every Planar Map is Four Colorable
• Theory of interevent interval distributions for stationary point processes
• Entropy of dialogues creates coherent structures in e-mail traffic
• Finite-time singularity in the dynamics of the world population, economic and financial indices

This page was built for publication: Challenges to the assessment of time-to-proof of mathematical conjectures