Search Results for ""

The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

In an integral domain R, the decomposition of a nonzero noninvertible element a as a product of prime (or irreducible) factors a=p_1...p_n, (1) is unique if every other ...

A mathematical relationship expressing f_n as some combination of f_i with i<n. When formulated as an equation to be solved, recurrence relations are known as recurrence ...

A method for finding roots of a polynomial equation f(x)=0. Now find an equation whose roots are the roots of this equation diminished by r, so (1) The expressions for f(r), ...

A method of determining coefficients alpha_l in an expansion y(x)=y_0(x)+sum_(l=1)^qalpha_ly_l(x) so as to nullify the values of an ordinary differential equation L[y(x)]=0 ...

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...

A nonplanar graph G is said to be critical nonplanar if the removal of a vertex results in a planar graph for every vertex of G. Critical nonplanar graphs differ from apex ...