Search Results for ""

Analysis of data ordered by the time the data were collected (usually spaced at equal intervals), called a time series. Common examples of a time series are daily temperature ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

A transformation T (a.k.a., map, function) over a domain D takes the elements X in D to elements Y in T(D), where the range (a.k.a., image) of T is defined as ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

While the pedal point, Cevian point, and even pedal-Cevian point are commonly used concepts in triangle geometry, there seems to be no established term to describe the ...

Given a reference triangle DeltaABC and a point P, the triple (x,y,z), with x=PA, y=PB and z=PC representing the distances from P to the vertices of the reference triangle, ...

The distribution for the sum X_1+X_2+...+X_n of n uniform variates on the interval [0,1] can be found directly as (1) where delta(x) is a delta function. A more elegant ...

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...

The unitary divisor function sigma_k^*(n) is the analog of the divisor function sigma_k(n) for unitary divisors and denotes the sum-of-kth-powers-of-the-unitary divisors ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...