6 citations · 6 across the 2 of their papers we have counts for
Showing math.AGShow all
2 papers · 1 filter
math.AG2005
Polynomial systems supported on circuits and dessins d'enfants
F. Bihan
We study polynomial systems whose equations have as common support a set C of n+2 points in Z^n called a circuit. We find a bound on the number of real solutions to such systems wh…
math.AG2004★ 6 cited
First Steps in Algorithmic Fewnomial Theory
Frederic Bihan, J. Maurice Rojas, Casey E. Stella
Fewnomial theory began with explicit bounds -- solely in terms of the number of variables and monomial terms -- on the number of real roots of systems of polynomial equations. Here…