Search Results for ""
8001 - 8010 of 13135 for Coordinate GeometrySearch Results
A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...
A centered triangular number is a centered polygonal number consisting of a central dot with three dots around it, and then additional dots in the gaps between adjacent dots. ...
The central beta function is defined by beta(p)=B(p,p), (1) where B(p,q) is the beta function. It satisfies the identities beta(p) = 2^(1-2p)B(p,1/2) (2) = ...
The central difference for a function tabulated at equal intervals f_n is defined by delta(f_n)=delta_n=delta_n^1=f_(n+1/2)-f_(n-1/2). (1) First and higher order central ...
The nth central fibonomial coefficient is defined as [2n; n]_F = product_(k=1)^(n)(F_(n+k))/(F_k) (1) = ...
The Cesàro means of a function f are the arithmetic means sigma_n=1/n(s_0+...+s_(n-1)), (1) n=1, 2, ..., where the addend s_k is the kth partial sum ...
Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...
For every p, the kernel of partial_p:C_p->C_(p-1) is called the group of cycles, Z_p={c in C_p:partial(c)=0}. (1) The letter Z is short for the German word for cycle, ...
Let A be a commutative complex Banach algebra. A nonzero homomorphism from A onto the field of complex numbers is called a character. Every character is automatically ...
The characteristic equation is the equation which is solved to find a matrix's eigenvalues, also called the characteristic polynomial. For a general k×k matrix A, the ...
...