Search Results for ""

A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

An apodization function given by A(x)=(21)/(50)+1/2cos((pix)/a)+2/(25)cos((2pix)/a), (1) which has full width at half maximum of 0.810957a. This function is defined so that ...

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...

If {a_j} subset= D(0,1) (with possible repetitions) satisfies sum_(j=1)^infty(1-|a_j|)<=infty, where D(0,1) is the unit open disk, and no a_j=0, then there is a bounded ...

The third-order ordinary differential equation 2y^(''')+yy^('')=0. This equation arises in the theory of fluid boundary layers, and must be solved numerically (Rosenhead ...

Any bounded planar region with positive area >A placed in any position of the unit square lattice can be translated so that the number of lattice points inside the region ...

The qubit |psi>=a|0>+b|1> can be represented as a point (theta,phi) on a unit sphere called the Bloch sphere. Define the angles theta and phi by letting a=cos(theta/2) and ...

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...