Search Results for ""

An abstract machine is a model of a computer system (considered either as hardware or software) constructed to allow a detailed and precise analysis of how the computer ...

The adjacency list representation of a graph consists of n lists one for each vertex v_i, 1<=i<=n, which gives the vertices to which v_i is adjacent. The adjacency lists of a ...

The set theory symbol aleph_0 refers to a set having the same cardinal number as the "small" infinite set of integers. The symbol aleph_0 is often pronounced "aleph-null" ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

In the algebraic geometry of Grothendieck, a stack refers to a sheaf of categories. In particular, a stack is a presheaf of categories in which the following descent ...

An almost perfect number, also known as a least deficient or slightly defective (Singh 1997) number, is a positive integer n for which the divisor function satisfies ...

For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...

An amicable quadruple as a quadruple (a,b,c,d) such that sigma(a)=sigma(b)=sigma(c)=sigma(d)=a+b+c+d, (1) where sigma(n) is the divisor function. If (a,b) and (x,y) are ...

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

An automorphic function f(z) of a complex variable z is one which is analytic (except for poles) in a domain D and which is invariant under a countably infinite group of ...