Search Results for ""

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

1. Find a complete system of invariants, or 2. Decide when two metrics differ only by a coordinate transformation. The most common statement of the problem is, "Given metrics ...

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...

The golden ratio, also known as the divine proportion, golden mean, or golden section, is a number often encountered when taking the ratios of distances in simple geometric ...

A geodesic triangle with oriented boundary yields a curve which is piecewise differentiable. Furthermore, the tangent vector varies continuously at all but the three corner ...

Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

A determinant appearing in Padé approximant identities: C_(r/s)=|a_(r-s+1) a_(r-s+2) ... a_r; | | ... |; a_r a_(r+1) ... a_(r+s-1)|.

The "Cartesian ovals," sometimes also known as the Cartesian curve or oval of Descartes, are the quartic curve consisting of two ovals. They were first studied by Descartes ...