How to recognize zero? (Q1382029): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q277571 |
Created claim: Wikidata QID (P12): Q55981126, #quickstatements; #temporary_batch_1712272666262 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Dumitru Buşneag / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jsco.1997.0157 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063118073 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q55981126 / rank | |||
Normal rank |
Latest revision as of 01:47, 5 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How to recognize zero? |
scientific article |
Statements
How to recognize zero? (English)
0 references
4 May 1998
0 references
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.
0 references
lazy sequence
0 references
characteristic sets
0 references
elementary number
0 references
algorithm
0 references
Schanuel's conjecture
0 references