Search Results for ""

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

Given a triangle DeltaABC and a point P not a vertex of DeltaABC, define the A^'-vertex of the circumcevian triangle as the point other than A in which the line AP meets the ...

The crystallographic point groups are the point groups in which translational periodicity is required (the so-called crystallography restriction). There are 32 such groups, ...

The symbol used to separate the integer part of a decimal number from its fractional part is called the decimal point. In the United States, the decimal point is denoted with ...

The radial curve of the deltoid x = 1/3a[2cost+cos(2t)] (1) y = 1/3a[2sint-sin(2t)] (2) with pedal point (x_0,y_0) is x_p = 1/6[3x+cost+3xcost-cos(2t)-3ysint] (3) y_p = ...

The Gauss map is a function N from an oriented surface M in Euclidean space R^3 to the unit sphere in R^3. It associates to every point on the surface its oriented unit ...

An interior point method is a linear or nonlinear programming method (Forsgren et al. 2002) that achieves optimization by going through the middle of the solid defined by the ...