Search Results for ""

The Knuth-Bendix completion algorithm attempts to transform a finite set of identities into a finitely terminating, confluent term rewriting system whose reductions preserve ...

The simplest interpretation of the Kronecker delta is as the discrete version of the delta function defined by delta_(ij)={0 for i!=j; 1 for i=j. (1) The Kronecker delta is ...

An L-algebraic number is a number theta in (0,1) which satisfies sum_(k=0)^nc_kL(theta^k)=0, (1) where L(x) is the Rogers L-function and c_k are integers not all equal to 0 ...

The Lambert azimuthal equal-area projection is a map projection having transformation equations x = k^'cosphisin(lambda-lambda_0) (1) y = ...

Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...

A closed interval corresponding to a finite portion of an infinite line. Line segments are generally labeled with two letters corresponding to their endpoints, say A and B, ...

States that for a nondissipative Hamiltonian system, phase space density (the area between phase space contours) is constant. This requires that, given a small time increment ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

By analogy with the log sine function, define the log cosine function by C_n=int_0^(pi/2)[ln(cosx)]^ndx. (1) The first few cases are given by C_1 = -1/2piln2 (2) C_2 = ...

The log sine function, also called the logsine function, is defined by S_n=int_0^pi[ln(sinx)]^ndx. (1) The first few cases are given by S_1 = -piln2 (2) S_2 = ...