Search Results for ""

A local sink is a node of a directed graph with no exiting edges, also called a terminal (Borowski and Borwein 1991, p. 401; left figure). A global sink (often simply called ...

The exponent laws, also called the laws of indices (Higgens 1998) or power rules (Derbyshire 2004, p. 65), are the rules governing the combination of exponents (powers). The ...

The sum over all external (square) nodes of the lengths of the paths from the root of an extended binary tree to each node. For example, in the tree above, the external path ...

The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...

The fibonomial coefficient (sometimes also called simply the Fibonacci coefficient) is defined by [m; k]_F=(F_mF_(m-1)...F_(m-k+1))/(F_1F_2...F_k), (1) where [m; 0]_F=1 and ...

An origami configuration that can be pressed to a plane figure without crumpling it or adding new creases.

A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...

The Frobenius norm, sometimes also called the Euclidean norm (a term unfortunately also used for the vector L^2-norm), is matrix norm of an m×n matrix A defined as the square ...

At rational arguments p/q, the digamma function psi_0(p/q) is given by psi_0(p/q)=-gamma-ln(2q)-1/2picot(p/qpi) +2sum_(k=1)^([q/2]-1)cos((2pipk)/q)ln[sin((pik)/q)] (1) for ...

A graceful permutation sigma on n letters is a permutation such that {|sigma(i)-sigma(i+1)|:i=1,2,...,n-1}={1,2,...,n-1}. For example, there are four graceful permutations on ...