Reproduce “On Deciding the Constraint Loop Problem in Dimension Two” 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
Daria Goliasova, Toghrul Karimov
The authors show that termination of two-variable real-valued loops with linear transition constraints can be decided in polynomial time. They reduce nontermination to checking a certificate containing an initial transition, a cone of step directions, and a linear map that preserves the cone. For cones with two generators, checking the generators suffices. The paper gives no result for three variables.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.