Search Results for ""

The (n+1)×(n+1) tridiagonal matrix (also called the Clement matrix) defined by S_n=[0 n 0 0 ... 0; 1 0 n-1 0 ... 0; 0 2 0 n-2 ... 0; | | ... ... ... |; 0 0 0 n-1 0 1; 0 0 0 0 ...

The function K_n(x_0,x)=K_n(x,x_0)^_=K_n(x^_,x^__0) which is useful in the study of many polynomials.

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...

The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...

The problem of deciding if two knots in three-space are equivalent such that one can be continuously deformed into another.

A knot diagram which does not specify whether crossings are under- or overcrossings.

A conjecture concerning primes.

A type of statistic which can be useful for determining asymmetry and tailedness of a population.

The orthogonal decomposition of a matrix into lower trapezoidal matrices.

A nonlinear deconvolution technique used in deconvolving images from the Hubble Space Telescope before corrective optics were installed.