Search Results for ""

The mathematical study of how given quantities can be approximated by other (usually simpler) ones under appropriate conditions. Approximation theory also studies the size ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...

There are at least two results known as "the area principle." The geometric area principle states that (|A_1P|)/(|A_2P|)=(|A_1BC|)/(|A_2BC|). (1) This can also be written in ...

The word argument is used in several differing contexts in mathematics. The most common usage refers to the argument of a function, but is also commonly used to refer to the ...

If f(z) is meromorphic in a region R enclosed by a contour gamma, let N be the number of complex roots of f(z) in gamma, and P be the number of poles in gamma, with each zero ...

The term "Aristotle gap"' is introduced in this work to refer to the angle between the first and last member of a 5-tetrahedral ring. This gap has angle measure theta = ...

An arithmetic function is a function f(n) defined for all n in N, usually taken to be complex-valued, so that f:N->C (Jones and Jones 1998, p. 143). An alternative definition ...

Consider the circle map. If K is nonzero, then the motion is periodic in some finite region surrounding each rational Omega. This execution of periodic motion in response to ...

The (n,k)-arrangement graph A_(n,k) is defined as the graph on the vertex set consisting of the permutations of {1,2,...,n} containing at most k elements where vertices are ...