Robust Satisfiability of Systems of Equations

  title={Robust Satisfiability of Systems of Equations},
  author={P. Franek and Marek Krc{\'a}l},
  journal={Journal of the ACM (JACM)},
  pages={1 - 19}
  • P. Franek, Marek Krcál
  • Published 2015
  • Mathematics, Computer Science
  • Journal of the ACM (JACM)
  • We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K → Rn on a finite simplicial complex K and α>0, it holds that each function g:K → Rn such that ║g−f║∞ ≤ α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dim K ≤ 2n−3. This is a substantial extension of previous computational… CONTINUE READING
    16 Citations
    Computing All Maps into a Sphere
    • 42
    • PDF
    Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers
    • 13
    • PDF
    Solving equations and optimization problems with uncertainty
    • 1
    • PDF
    On Computability and Triviality of Well Groups
    • 2
    • PDF
    Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
    • 41
    • PDF
    Decidability of the Extension Problem for Maps into Odd-Dimensional Spheres
    • L. Vokrínek
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 2017
    • 4
    Computing Simplicial Representatives of Homotopy Group Elements
    • 3
    • PDF
    Solvability Regions of Affinely Parameterized Quadratic Equations
    • 19
    • PDF
    Cohomotopy groups capture robust properties of zero sets
    • 4
    • PDF


    Symbolic–Numeric Techniques for Solving Nonlinear Systems
    • 11
    • Highly Influential
    Quasi-decidability of a fragment of the analytic first-order theory of real numbers
    • Preprint arXiv:1309.6280.
    • 2015
    A Course in Topological Combinatorics. Universitext
    • A Course in Topological Combinatorics. Universitext
    • 2012
    Persistent homology—a survey In Surveys on discrete and computational geometry, volume 453 of Contemp
    • Math. Amer. Math. Soc
    • 2008
    Persistent homology—a survey. In Surveys on discrete and computational geometry, volume 453 of Contemp. Math., pages 257–282
    • 2008
    A user's guide to discrete Morse theory. Sém. Lothar. Combin 48, B48c
    • Journal of the ACM
    • 2002