activity
20022026
most citedThe computational complexity of the Chow form

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

math.AG2026

New bounds for the support of input-output equations in differential-algebraic systems

Gabriela Jeronimo, Leonardo Lanciano

Given a polynomial dynamical system together with an observation function , where $\mathbf{x}=(x_1,\ldot…

math.CO2026

Shuffling the Deck: Invariant Theory and the Graph Reconstruction Conjecture

Emilie Dufresne, Gabriela Jeronimo, Jenny Kenkel +2

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository ar…

math.AG2024

Sparse Nullstellensatz, resultants and determinants of complexes

Carlos D'Andrea, Gabriela Jeronimo

We refine and extend a result by Tuitman on the supports of a Bezout identity satisfied by a finite sequence of sparse Laurent polynomials without common zeroes in the toric variet…

math.AG2024

On the geometric degree of the tangent bundle of a smooth algebraic variety

Gabriela Jeronimo, Leonardo Lanciano, Pablo Solernó

We present bounds for the geometric degree of the tangent bundle and the tangential variety of a smooth affine algebraic variety in terms of the geometric degree of . We fir…

math.AG2002★ 1 cited

The computational complexity of the Chow form

Gabriela Jeronimo, Teresa Krick, Juan Sabia +1

We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the leng…