Reproduce “Recursive Reasoning Exploration: Mathematical Research through Evolving Reasoning Graphs : case study: An Exact Certificate-Degree Theorem for Two-Term Tensor Decompositions : Phase III of the Math Instruments Program” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Ying Xie
The authors present Recursive Reasoning with Evidence (RRE), a versioned record for research targets, premises, routes, evidence, and revisions, alongside a tensor-rank result. For complex order-n tensors of rank greater than two, they prove that the least certificate degree for the original two-term decomposition equations is exactly 3n, including dimension-one modes. Flattenings can miss exact non-decomposability; RRE’s effectiveness remains untested.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.