Search Results for ""

If A is a normed algebra, a net {e_i} in A is called an approximate identity for A if sup_(i)|e_i|<infty and if for each a in A, e_ia->a and ae_i->a. Though this definition ...

An approximate unit for a C^*-algebra A is an increasing net {u_lambda}_(lambda in Lambda) of positive elements in the closed unit ball of A such that a=lim_(lambda)au_lambda ...

The approximation problem is a well known problem of functional analysis (Grothendieck 1955). It asks to determine whether every compact operator T from a Banach space X to a ...

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 ...

Let a_n and b_n be the perimeters of the circumscribed and inscribed n-gon and a_(2n) and b_(2n) the perimeters of the circumscribed and inscribed 2n-gon. Then a_(2n) = ...

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 = ...

The arithmetic-geometric energy of a graph is defined as the graph energy of its arithmetic-geometric matrix, i.e., the sum of the absolute values of the eigenvalues of its ...