3 papers
cs.CC2025
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
Klara Nosan, Amaury Pouly, Sylvain Schmitz +2
We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jean…
cs.CC2024
A parametric version of the Hilbert Nullstellensatz
Rida Ait El Manssour, Nikhil Balaji, Klara Nosan +2
Hilbert's Nullstellensatz is a fundamental result in algebraic geometry that gives a necessary and sufficient condition for a finite collection of multivariate polynomials to have…
cs.CC2024
Identity Testing for Radical Expressions
Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi +1
We study the Radical Identity Testing problem (RIT): Given an algebraic circuit representing a polynomial and nonnegative integers $a_1, \ldots,…