Reproduce “Symbolic Sets for Proving Bounds on Rado Numbers” 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
Tanbir Ahmed, Lamina Zaman, Curtis Bright
A SAT-and-symbolic-computation workflow expands the study of three-color Rado numbers for the families $ax+by=bz$ and $ax+ay=bz$. It produces parameter tables over extended ranges, proves two general lower bounds through structured colorings, and uses the AutoCase tool to mechanically verify symbolic partitions and the absence of monochromatic solutions.
Key insights
- For coprime $a>b\geq3$ satisfying $a^2+a+b>b^2+ab$, the constructed coloring yields $R_3(\mathcal{E}(3,0;a,b,b))\geq a^3+a^2+(2b+1)a+1$, conjectured to be exact across the stated range.
- For odd $a\geq7$, a divisibility-based block coloring gives $R_3(\mathcal{E}(3,0;a,a,a+1))\geq a^3(a+1)$; related data suggest the formula $R_3(\mathcal{E}(3,0;a,a,b))=a^3b$ when $a$ is odd and $3\leq a<b\leq2a-1$.
- The work illustrates a discovery-to-proof pipeline: SAT exposes recurring coloring structures, while symbolic set reasoning and SMT checks make the resulting arithmetic case analyses auditable.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.