TOPICS
Search

Search Results for ""


8181 - 8190 of 13135 for Absolute GeometrySearch Results
A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...
A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of ...
A topological space X such that for every closed subset C of X and every point x in X\C, there is a continuous function f:X->[0,1] such that f(x)=0 and f(C)={1}. This is the ...
A metric space X which is not complete has a Cauchy sequence which does not converge. The completion of X is obtained by adding the limits to the Cauchy sequences. For ...
Let z=x+iy and f(z)=u(x,y)+iv(x,y) on some region G containing the point z_0. If f(z) satisfies the Cauchy-Riemann equations and has continuous first partial derivatives in ...
The differential forms on C^n decompose into forms of type (p,q), sometimes called (p,q)-forms. For example, on C, the exterior algebra decomposes into four types: ^ C = ^ ^0 ...
A complex manifold is a manifold M whose coordinate charts are open subsets of C^n and the transition functions between charts are holomorphic functions. Naturally, a complex ...
A measure which takes values in the complex numbers. The set of complex measures on a measure space X forms a vector space. Note that this is not the case for the more common ...
An improper use of the symbol sqrt(-1) for the imaginary unit leads to the apparent proof of a false statement. sqrt(-1) = sqrt(-1) (1) sqrt((-1)/1) = sqrt(1/(-1)) (2) ...
The complexity of a process or algorithm is a measure of how difficult it is to perform. The study of the complexity of algorithms is known as complexity theory. In general, ...
1 ... 816|817|818|819|820|821|822 ... 1314 Previous Next

...