Reproduce “Determinant boundaries and gaps in determinantal complexity” 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
Karthik Sheshadri
The authors construct explicit degree-n forms in n² variables on determinant-boundary components for every n≥10. Their border determinantal complexity is n, because fixed-size determinants can converge to them, while a kernel-degree argument proves that every exact affine determinantal representation has size at least 2n−1. Thus the exact-versus-border gap grows linearly; the exact complexity remains undetermined.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.