Related papers: Rolle models in the real and complex world

Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…

Section 10.4 of the 1998 Springer-Verlag book {\em Complexity and Real Computation}, by Blum, Cucker, Shub, and Smale, contains a particularly elegant proof of the Fundamental Theorem of Algebra: The central idea of the proof naturally…

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

We introduce a novel integrability-preserving discretization for a broad class of differential equations with variable coefficients, encompassing both linear and nonlinear cases. The construction is achieved via a categorical approach that…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

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…

Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…

Random matrices in the large N expansion and the so-called double scaling limit can be used as toy models for quantum gravity: 2D quantum gravity coupled to conformal matter. This has generated a tremendous expansion of random matrix…

Let $V$ be the set of real common solutions to $F = (f_1, \ldots, f_s)$ in $\mathbb{R}[x_1, \ldots, x_n]$ and $D$ be the maximum total degree of the $f_i$'s. We design an algorithm which on input $F$ computes the dimension of $V$. Letting…

We consider the problem of counting polynomial curves on analytic or definable subsets over the field ${\mathbb{C}}(\!(t)\!)$, as a function of the degree $r$. A result of this type could be expected by analogy with the classical…

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

We give formulas and effective sharp bounds for the degree of multi-graded rational maps and provide some effective and computable criteria for birationality in terms of their algebraic and geometric properties. We also extend the Jacobian…

We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…

Resolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting. Denoted Res(lin_R), this refutation system operates with disjunctions of linear…

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that…