Search Results for ""

The omega constant is defined as W(1)=0.5671432904... (1) (OEIS A030178), where W(x) is the Lambert W-function. It is available in the Wolfram Language using the function ...

The operator norm of a linear operator T:V->W is the largest value by which T stretches an element of V, ||T||=sup_(||v||=1)||T(v)||. (1) It is necessary for V and W to be ...

An ordered pair representation is a representation of a directed graph in which edges are specified as ordered pairs or vertex indices. The ordered pairs representation of a ...

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

Parametric equations are a set of equations that express a set of quantities as explicit functions of a number of independent variables, known as "parameters." For example, ...

A rational function P(x)/Q(x) can be rewritten using what is known as partial fraction decomposition. This procedure often allows integration to be performed on each term ...

The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...

Three types of n×n matrices can be obtained by writing Pascal's triangle as a lower triangular matrix and truncating appropriately: a symmetric matrix S_n with (S)_(ij)=(i+j; ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...