Search Results for ""

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

Let the elliptic modulus k satisfy 0<k^2<1. (This may also be written in terms of the parameter m=k^2 or modular angle alpha=sin^(-1)k.) The incomplete elliptic integral of ...

The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...

Generally speaking, a Green's function is an integral kernel that can be used to solve differential equations from a large number of families including simpler examples such ...

A constant, sometimes also called a "mathematical constant," is any well-defined real number which is significantly interesting in some way. In this work, the term "constant" ...

Roman numerals are a system of numerical notations used by the Romans. They are an additive (and subtractive) system in which letters are used to denote certain "base" ...

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

The divergence of a vector field F, denoted div(F) or del ·F (the notation used in this work), is defined by a limit of the surface integral del ·F=lim_(V->0)(∮_SF·da)/V (1) ...

A rook polynomial is a polynomial R_(m,n)(x)=sum_(k=0)^(min(m,n))r_kx^k (1) whose number of ways k nonattacking rooks can be arranged on an m×n chessboard. The rook ...

Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...