Search Results for ""

A cylindrical algebraic decomposition that omits sets of measure zero. Generic cylindrical algebraic decompositions are generally much quicker to compute than are normal ...

The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...

A quantity a is said to be greater than b if a is larger than b, written a>b. If a is greater than or equal to b, the relationship is written a>=b. In the Wolfram Language, ...

A quantity a is said to be less than b if a is smaller than b, written a<b. If a is less than or equal to b, the relationship is written a<=b. In the Wolfram Language, this ...

F_k[P_N(k)](x)=F_k[exp(-N|k|^beta)](x), where F is the Fourier transform of the probability P_N(k) for N-step addition of random variables. Lévy showed that beta in (0,2) for ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

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

The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...

The quotient of two polynomials p(x) and q(x), discarding any polynomial remainder. Polynomial quotients are implemented in the Wolfram Language as PolynomialQuotient[p, q, ...

The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...