Related papers: Computing the Real Isolated Points of an Algebraic…

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

Let $P \in \mathbb{Z} [X, Y]$ be a given square-free polynomial of total degree $d$ with integer coefficients of bitsize less than $\tau$, and let $V_{\mathbb{R}} (P) := \{ (x,y) \in \mathbb{R}^2, P (x,y) = 0 \}$ be the real planar…

Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…

We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on…

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

We formulate a resolution of singularities algorithm for analyzing the zero sets of real-analytic functions in dimensions $\geq 3$. Rather than using the celebrated result of Hironaka, the algorithm is modeled on a more explicit and…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…

We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…

Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

In this article, we study the complexity involved in the computation of the reach in arbitrary dimension and in particular the computation of the critical spherical curvature points of an arbitrary algebraic variety. We present properties…

We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…

The canonical projections of the unit spheres are generalized to special generic maps and round fold maps, for example. They are generalizations from the viewpoint of singularity theory of differentiable maps and these maps restrict the…

In this paper we describe how to improve the performance of the symbolic-numeric method in (Li and Zhi,2009, 2011) for computing the multiplicity structure and refining approximate isolated singular solutions in the breadth one case. By…

Physically meaningful periodic solutions to certain integrable partial differential equations are given in terms of multi-dimensional theta functions associated to real Riemann surfaces. Typical analytical problems in the numerical…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…

Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…