AbstractLet f≔(f1,…,fn) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/ε. The bound depends on an integral of a differential form on a toric manifold and admits a simple explicit upper bound when the Newton polytopes (and underlying variances) are all identical.We also consider polynomials with real coefficients and give bounds for the expected number of real roots and (restricted) condition number. Using a Kähler geometric framework throughout, we also express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form, thus recovering the classical mixed volume when...
AbstractWe exhibit sharp upper bounds for the probability distribution of the distance from a system...
Abstract. For a system of Laurent polynomials f1,..., fn ∈ C[x±11,..., x±1n] whose coefficients are ...
A sparse polynomial (also called a lacunary polynomial) is a polynomial that has relatively few term...
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic g...
Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse sys...
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic...
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic...
International audienceThe condition-based complexity analysis framework is one of the gems of modern...
Computational algebraic geometry is the study of roots of polynomials and polynomial systems. We are...
Computational algebraic geometry is the study of roots of polynomials and polynomial systems. We are...
International audienceFor a system of Laurent polynomials f1 , . . . , fn ∈ C[x_1^±1 , . . . , x_n^±...
We obtain a new lower bound on the size of value set V (ƒ) = ƒ(Fp) of a sparse polynomial ƒ ϵ Fp[X]...
International audienceFor a system of Laurent polynomials f1 , . . . , fn ∈ C[x_1^±1 , . . . , x_n^±...
We obtain a new lower bound on the size of the value set of a sparse polynomial over a finite field ...
AbstractWe show how to construct sparse polynomial systems that have non-trivial lower bounds on the...
AbstractWe exhibit sharp upper bounds for the probability distribution of the distance from a system...
Abstract. For a system of Laurent polynomials f1,..., fn ∈ C[x±11,..., x±1n] whose coefficients are ...
A sparse polynomial (also called a lacunary polynomial) is a polynomial that has relatively few term...
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic g...
Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse sys...
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic...
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic...
International audienceThe condition-based complexity analysis framework is one of the gems of modern...
Computational algebraic geometry is the study of roots of polynomials and polynomial systems. We are...
Computational algebraic geometry is the study of roots of polynomials and polynomial systems. We are...
International audienceFor a system of Laurent polynomials f1 , . . . , fn ∈ C[x_1^±1 , . . . , x_n^±...
We obtain a new lower bound on the size of value set V (ƒ) = ƒ(Fp) of a sparse polynomial ƒ ϵ Fp[X]...
International audienceFor a system of Laurent polynomials f1 , . . . , fn ∈ C[x_1^±1 , . . . , x_n^±...
We obtain a new lower bound on the size of the value set of a sparse polynomial over a finite field ...
AbstractWe show how to construct sparse polynomial systems that have non-trivial lower bounds on the...
AbstractWe exhibit sharp upper bounds for the probability distribution of the distance from a system...
Abstract. For a system of Laurent polynomials f1,..., fn ∈ C[x±11,..., x±1n] whose coefficients are ...
A sparse polynomial (also called a lacunary polynomial) is a polynomial that has relatively few term...