Search Results for ""

A method for fitting a curve (not necessarily a straight line) through a set of points using some goodness-of-fit criterion. The most common type of regression is linear ...

The dodecahedron has four stellations: the original dodecahedron, small stellated dodecahedron, great dodecahedron, and great stellated dodecahedron (Wenninger 1989, pp. 35 ...

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

A (2n)×(2n) complex matrix A in C^(2n×2n) is said to be Hamiltonian if J_nA=(J_nA)^(H), (1) where J_n in R^(2n×2n) is the matrix of the form J_n=[0 I_n; I_n 0], (2) I_n is ...

n vectors X_1, X_2, ..., X_n are linearly dependent iff there exist scalars c_1, c_2, ..., c_n, not all zero, such that sum_(i=1)^nc_iX_i=0. (1) If no such scalars exist, ...

A dissection of a rectangle into smaller rectangles such that the original rectangle is not divided into two subrectangles. Rectangle dissections into 3, 4, or 6 pieces ...

A theorem giving a criterion for an origami construction to be flat. Kawasaki's theorem states that a given crease pattern can be folded to a flat origami iff all the ...

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

An n-step Fibonacci sequence {F_k^((n))}_(k=1)^infty is defined by letting F_k^((n))=0 for k<=0, F_1^((n))=F_2^((n))=1, and other terms according to the linear recurrence ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...