Rigid homotopies achieve a new complexity result for polynomial systems with prescribed-length Waring representations, backed by initial experiments.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A certified computational workflow computes and verifies monodromy triples for Belyi maps and applies it at scale to the LMFDB database.
citing papers explorer
-
Rigid homotopies for sampling from algebraic varieties: a Waring structure complexity model
Rigid homotopies achieve a new complexity result for polynomial systems with prescribed-length Waring representations, backed by initial experiments.
-
Belyi map verification using certified path tracking
A certified computational workflow computes and verifies monodromy triples for Belyi maps and applies it at scale to the LMFDB database.