2. Computability and Complexity Tools from real algebraic geometry are very well suited for studying computability and complexity questions.
Statement
- Computability and Complexity Tools from real algebraic geometry are very well suited for studying computability and complexity questions. For example Annie Raymond spoke about the unde- cidability of the general problem of deciding algebraic inequalities between graph homomorphism densities. Evelyne Hubert spoke about a new approach for op- timizing symmetric trigometric functions over Rn and applications to the explo- ration of the spectral bound on the chromatic numbers of set avoiding graphs. Peter Bürgisser spoke about the real zeros of random structured polynomial and in particular his proof of a probabilistic version of the real tau conjecture. Hamza Fawzi introduced the notion of k-local Hamiltonian systems and described how to compute their ground energy via a large convex optimization problem based on entropy constraints. nonreduced projective schemes that are naturally associated to certain faces of the cone of nonnegative polynomials. Lorenzo Baldi reported on a characterization of the extreme rays of the cone of nonnegative forms on elliptic normal curves in terms of their group law and the real geometry of their 2-torsion points. Matilde Manzaroli gave a bound for the real Betti numbers of a smooth fiber of a real semistable degeneration near a certain special fiber X0 in terms of the complex geometry of X0 . Rainer Sinn explained the role played by real cubic surfaces and the Schläfli double six in computer vision. 3. Convexity The connection of real algebraic geometry to convexity and optimization has proven very productive in recent years. The conference also included some talks on this topic. Chiara Meroni explained partial progress on two open problems from convexity theory. One is asking for a classification of zonoids, the other is trying to describe directional convex hulls as semialgebraic sets. Julian Vill spoke about fiber bodies of projected convex sets, and in particular about those of Gram spec- trahedra of binary sextics and ternary quartics, in which case the facial structure of the fiber bodies can be determined rather explicitly.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.