Reproduce “Some algebraic and geometric computations in CH via Chow forms” 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

Robert Andrews, Abhibhav Garg, Rafael Oliveira, Éric Schost

The authors construct circuits for Chow forms of equidimensional components of polynomial varieties. They form candidate components for each dimension in parallel, then use containment relations and GCD computations to remove excess pieces. The polylogtime-uniform, constant-depth threshold circuits yield counting hierarchy upper bounds, including rational point membership in a dimension-k component. They establish complexity bounds, not practical speedups.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.