Search Results for ""

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...

If lim_(z->z_0)(f(z)-f(z_0))/(z-z_0) is the same for all paths in the complex plane, then f(z) is said to be monogenic at z_0. Monogenic therefore essentially means having a ...

A constant appearing in formulas for the efficiency of the Euclidean algorithm, B = (12ln2)/(pi^2)[-1/2+6/(pi^2)zeta^'(2)]+C-1/2 (1) = 0.06535142... (2) (OEIS A143304), where ...

The four of Hilbert's axioms which concern the arrangement of points.

Given four points, A, B, C, and H, let H be the orthocenter of DeltaABC. Then A is the orthocenter DeltaHBC, B is the orthocenter of DeltaHAC, and C is the orthocenter of ...

If two pairs of opposite sides of a complete quadrilateral are pairs of perpendicular lines, the quadrilateral is said to be orthocentric. In such a case, the remaining sides ...

One of the operations exists exists (called the existential quantifier) or for all forall (called the universal quantifier, or sometimes, the general quantifier). However, ...

The unit fraction 1/4, also called one-fourth. 1/4 is a rational number with terminating decimal expansion 0.25.

A statistical test making use of the statistical ranks of data points. Examples include the Kolmogorov-Smirnov test and Wilcoxon signed rank test.

Given a polynomial in a single complex variable with complex coefficients p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, the reciprocal polynomial is defined by ...