3 papers
cs.CC2025
Positive Univariate Polynomials: SOS certificates, algorithms, bit complexity, and T-systems
Matías Bender, Philipp Di Dio, Elias Tsigaridas
We consider certificates of positivity for univariate polynomials with rational coefficients that are positive over (an interval of)~. Such certificates take the form o…
math.OC2025
Nash equilibria in semidefinite games and Lemke-Howson paths
Constantin Ickstadt, Thorsten Theobald, Elias Tsigaridas +1
We consider an algorithmic framework for two-player non-zero-sum semidefinite games, where each player's strategy is a positive semidefinite matrix with trace one. We formulate the…
math.AC2025
Solving bihomogeneous polynomial systems with a zero-dimensional projection
Matías Bender, Laurent Busé, Carles Checa +1
We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points.…