How to recognize zero?
An elementary point is a point in complex \(n\) space which is an isolated, nonsingular solution of \(n\) equations in \(n\) variables, each equation being either of the form \(p=0\), where \(p\) is a polynomial in \(\mathbb{Q}[x_1, \dots, x_n]\), or of the form \(x_j-e^{x_i}=0\). An elementary number is the polynomial image of an elementary point. The scope of this paper is to present a semi-algorithm to decide whether or not a given elementary number is zero. It is proved that this semi-algorithm is an algorithm, i.e. that it always terminates, unless it is given a problem containing a counterexample to Schanuel's conjecture.
- Fast evaluation of holonomic functions
- Elimination of infinitesimal quantifiers
- On the computation of limsups
- Use of algebraically independent numbers for zero recognition of polynomial terms.
- Recent progress in exact geometric computation
- Weak Wu stratification in \(\mathbb{R}^n\)
- System design of stochastic models using robustness of temporal properties
- Positive root isolation for poly-powers by exclusion and differentiation
- Guessing singular dependencies
- Complexity bounds for zero-test algorithms
- Zero tests for constants in simple scientific computation
- Counterexamples to the uniformity conjecture
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
- Foundations of Exact Rounding
- scientific article; zbMATH DE number 1263427 (Why is no real title available?)
- scientific article; zbMATH DE number 1071429 (Why is no real title available?)
- scientific article; zbMATH DE number 953038 (Why is no real title available?)
- Quantifier elimination for a class of exponential polynomial formulas
- What can we do with a solution?
- Bayesian-multiplicative treatment of count zeros in compositional data sets
- Fast evaluation of holonomic functions near and in regular singularities
- Multiplicative independence of algebraic numbers and expressions
- Meta-expansion of transseries
- A probabilistic logic for verifying continuous-time Markov chains
- Reachability analysis of linear systems
- Identity testing for radical expressions
- Calcium. Computing in exact real and complex fields
- The threshold problem for hypergeometric sequences with quadratic parameters
- Nonnegativity problems for matrix semigroups
- Reduction of transcendental decision problems over the reals
- Real root isolation for exp-log-arctan functions
- Computations with effective real numbers
This page was built for publication: How to recognize zero?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382029)
