Connected research memory
Research graph
Follow a claim to its evidence. Trace a dependency. Find the next verification task.
Choose another starting point
- Riemann Hypothesis
number-theory
- P versus NP
theoretical-computer-science
- Erdős discrepancy problem
combinatorics
- Hales–Jewett number HJ(3,3)
combinatorics
- Maximum vertex number of a (3,5)-zonoboxtope
geometry-topology
- Hales–Jewett number HJ(4,2)
combinatorics
- The Proportion of Zeta Zeros on the Critical Line
number-theory
- The Modular Family of 2-Tori as a Complex Structure on
geometry-topology
- Jacobian Conjecture
algebra
- Prime Gaps at Most 186
number-theory
- Bounded prime gaps:
number-theory
Erdős discrepancy problem
→ Select a node to read its full record below or alongside the graph. Arrows follow the recorded relationship direction. Dense views label selected connections; the list keeps every visible relationship.
Read the relationships, not just the lines
Arrows run from source to target. “Depends on” and “implies” record mathematical assertions. “Evidence for,” “derived from,” and attribution links record support or provenance. A shared author or publication is not a proof dependency.
Verification status belongs to the underlying claim and evidence. A graph connection does not establish correctness. This is a bounded neighborhood, not a complete map of mathematics.