Search Results for ""

C. Kimberling has extensively tabulated and enumerated the properties of triangle centers (Kimberling 1994, 1998, and online), denoting the nth center in his numbering scheme ...

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 lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...

A general set of methods for integrating ordinary differential equations. Predictor-corrector methods proceed by extrapolating a polynomial fit to the derivative from the ...

A pathwise-connected domain is said to be simply connected (also called 1-connected) if any simple closed curve can be shrunk to a point continuously in the set. If the ...

A number traditionally associated with bad luck. A so-called baker's dozen is equal to 13. Fear of the number 13 is called triskaidekaphobia. There are 13 Archimedean solids. ...

An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...

A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...

A point B is said to lie between points A and C (where A, B, and C are distinct collinear points) if AB+BC=AC. A number of Euclid's proofs depend on the idea of betweenness ...

If a continuous function defined on an interval is sometimes positive and sometimes negative, it must be 0 at some point. Bolzano (1817) proved the theorem (which effectively ...