6 citations · 6 across the 1 of their papers we have counts for
3 papers
math.AG2018
Low degree approximation of random polynomials
Daouda Niang Diatta, Antonio Lerario
We prove that with "high probability" a random Kostlan polynomial in many variables and of degree can be approximated by a polynomial of "low degree" without changing the…
math.AG2018
Bounds for polynomials on algebraic numbers and application to curve topology
Daouda Niang Diatta, Sény Diatta, Fabrice Rouillier +2
Let be a given square-free polynomial of total degree with integer coefficients of bitsize less than , and let $V_{\mathbb{R}} (P) := \{ (x,y) \in…
math.AC2008★ 6 cited
On the Computation of the Topology of a Non-Reduced Implicit Space Curve
Daouda Niang Diatta, Bernard Mourrain, Olivier Ruatta
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise L…