相关论文: Computations with one and two real algebraic numbe…

In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…

We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good…

Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…

We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…

Isolating the real roots of univariate polynomials is a fundamental problem in symbolic computation and it is arguably one of the most important problems in computational mathematics. The problem has a long history decorated with numerous…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

As the real counterpart of double Hurwitz number, the real double Hurwitz number depends on the distribution of real branch points. We consider the problem of asymptotic growth of real and complex double Hurwitz numbers. We provide a lower…

For the general monic quintic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities together…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

Our probabilistic analysis sheds light to the following questions: Why do random polynomials seem to have few, and well separated real roots, on the average? Why do exact algorithms for real root isolation may perform comparatively well or…

Subresultants of two univariate polynomials are one of the most classic and ubiquitous objects in computational algebra and algebraic geometry. In 1948, Habicht discovered and proved interesting relationships among subresultants. Those…

Following our previous work, we suggest here a large class of algebras of scalars in which simultaneous and correlated computations can be performed owing to the existence of surjective algebra homomorphisms. This may replace the currently…

We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

In 1969, H. Davenport and W. M. Schmidt studied the problem of approximation to a real number \xi by algebraic integers of degree at most three. They did so, using geometry of numbers, by resorting to the dual problem of finding…

Singular equations with rank-deficient Jacobians arise frequently in algebraic computing applications. As shown in case studies in this paper, direct and intuitive modeling of algebraic problems often results in nonisolated singular…

Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…

Many problems in computer algebra and numerical analysis can be reduced to counting or approximating the real roots of a polynomial within an interval. Existing verified root-counting procedures in major proof assistants are mainly based on…

We solve a special type of linear systems with coefficients in multivariate polynomial rings. These systems arise in the computation of parametric Bernstein-Sato polynomials associated with certain hypergeometric ideals in the Weyl algebra.