Constant problem

Constant problem

In mathematics, the constant problem is the problem of deciding if a given expression is equal to zero.

Contents

The problem

This problem is also referred to as the identity problem[1] or the method of zero estimates. It has no formal statement as such but refers to a general problem prevalent in transcendence theory. Often proofs in transcendence theory are proofs by contradiction, specifically they use some auxiliary function to create an integer n ≥ 0 which is shown to satisfy n < 1. Clearly this means that n must have the value zero, and so a contradiction arises if one can show that in fact n is not zero.

In many transcendence proofs, proving that n ≠ 0 is very difficult, and hence a lot of work has been done to develop methods that can be used to prove the non-vanishing of certain expressions. The sheer generality of the problem is what makes it difficult to prove general results or come up with general methods for attacking it. The number n that arises may involve integrals, limits, polynomials, other functions, and determinants of matrices.

Results

In certain cases algorithms or other methods exist for proving that a given expression is non-zero, or of showing that the problem is undecidable. For example, if x1, ..., xn are real numbers then there is an algorithm[2] for deciding if there are integers a1, ..., an such that

|a_1 x_1+{}\cdots{}+a_n x_n|=0.\,

If the expression we are interested in contains a function which oscillates, such as the sine or cosine function, then it has been shown that the problem is undecidable, a result known as Richardson's theorem. In general, methods specific to the expression being studied are required to prove that it cannot be zero.

See also

Integer relation algorithm

References

  1. ^ D. Richardson, "Some Unsolvable Problems Involving Elementary Functions of a Real Variable." J. Symbolic Logic 33, pp. 514–520, (1968).
  2. ^ D. H. Bailey, "Numerical Results on the Transcendence of Constants Involving e, π, and Euler's Constant." Math. Comput. 50, 275-281, (1988).

Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Constant voltage speaker system — Constant voltage speaker systems refer to networks of loudspeakers which are connected to an audio amplifier using step up and step down transformers to simplify impedance calculations and to minimize power loss over the speaker cables. They are… …   Wikipedia

  • Problem gambling — Classification and external resources ICD 10 F63.0 ICD 9 312.31 …   Wikipedia

  • Constant false alarm rate — (CFAR) detection refers to a common form of adaptive algorithm used in radar systems to detect target returns against a background of noise, clutter and interference. Other detection algorithms are not adaptive. Non adaptive detectors are… …   Wikipedia

  • Constant bitrate — (CBR) is a term used in telecommunications, relating to the quality of service. Compare with variable bitrate. When referring to codecs, constant bit rate encoding means that the rate at which a codec s output data should be consumed is constant …   Wikipedia

  • Constant of integration — In calculus, the indefinite integral of a given function (i.e., the set of all antiderivatives of the function) is only defined up to an additive constant, the constant of integration.[1][2] This constant expresses an ambiguity inherent in the… …   Wikipedia

  • Constant purchasing power accounting — Accountancy Key concepts Accountant · Accounting period · Bookkeeping · Cash and accrual basis · Cash flow management · Chart of accounts  …   Wikipedia

  • Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… …   Wikipedia

  • Constant time — In computational complexity theory, constant time, or O(1) time, refers to the computation time of a problem when the time needed to solve that problem does not depend on the size of the data it is given as input.For example, accessing any single …   Wikipedia

  • Constant capital — Part of a series on Marxism …   Wikipedia

  • Constant-weight code — In coding theory, a constant weight code, also called an m of n code, is an error detection and correction code where all codewords share the same Hamming weight. The theory is closely connected to that of designs (such as t designs and Steiner… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”