[图书][B] Real solutions to equations from geometry

F Sottile - 2011 - books.google.com
Understanding, finding, or even deciding on the existence of real solutions to a system of
equations is a difficult problem with many applications outside of mathematics. While it is …

Semidefinite characterization and computation of zero-dimensional real radical ideals

JB Lasserre, M Laurent, P Rostalski - Foundations of Computational …, 2008 - Springer
For an ideal I⊆ ℝ [x] given by a set of generators, a new semidefinite characterization of its
real radical I (V ℝ (I)) is presented, provided it is zero-dimensional (even if I is not) …

Shallow circuits with high-powered inputs

P Koiran - arXiv preprint arXiv:1004.4960, 2010 - arxiv.org
A polynomial identity testing algorithm must determine whether an input polynomial (given
for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show that a …

[图书][B] How Many Zeroes?: Counting Solutions of Systems of Polynomials Via Toric Geometry at Infinity

P Mondal - 2021 - books.google.com
This graduate textbook presents an approach through toric geometry to the problem of
estimating the isolated solutions (counted with appropriate multiplicity) of n polynomial …

Descartes' rule of signs for polynomial systems supported on circuits

F Bihan, A Dickenstein - International Mathematics Research …, 2017 - academic.oup.com
We give a multivariate version of Descartes' rule of signs to bound the number of positive
real roots of a system of polynomial equations in variables with monomials, in terms of the …

Extremal real algebraic geometry and A-discriminants

A Dickenstein, JM Rojas, K Rusek, J Shih - arXiv preprint math/0609485, 2006 - arxiv.org
We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture.
Along the way, we illustrate a computer-assisted approach to finding sparse polynomial …

A polyhedral method for sparse systems with many positive solutions

F Bihan, F Santos, PJ Spaenlehauer - SIAM Journal on Applied Algebra and …, 2018 - SIAM
We investigate a version of Viro's method for constructing polynomial systems with many
positive solutions, based on regular triangulations of the Newton polytope of the system. The …

On the number of real zeros of random fewnomials

P Bürgisser, AA Ergur, J Tonelli-Cueto - SIAM Journal on Applied Algebra …, 2019 - SIAM
Consider a system f_1(x)=0,...,f_n(x)=0 of n random real polynomial equations in n variables,
where each f_i has a prescribed set of exponent vectors described by a set A⊆N^n of …

Optimal Descartes' rule of signs for systems supported on circuits

F Bihan, A Dickenstein, J Forsgård - Mathematische Annalen, 2021 - Springer
We present an optimal version of Descartes' rule of signs to bound the number of positive
real roots of a sparse system of polynomial equations in n variables with n+ 2 monomials …

Weakly reversible mass-action systems with infinitely many positive steady states

B Boros, G Craciun, PY Yu - SIAM Journal on Applied Mathematics, 2020 - SIAM
We show that weakly reversible mass-action systems can have a continuum of positive
steady states, coming from the zeroes of a multivariate polynomial. Moreover, the same is …