Search Results for ""

Also known as metric entropy. Divide phase space into D-dimensional hypercubes of content epsilon^D. Let P_(i_0,...,i_n) be the probability that a trajectory is in hypercube ...

The Koolen-Riebeek graph is a weakly regular graph on 486 vertices with parameters (nu,k,lambda,mu)=(486,45,0,(0,9)). It is distance-regular but not distance-transitive with ...

The lines joining the vertices A, B, and C of a given triangle DeltaABC with the circumcenters of the triangles DeltaBCO, DeltaCAO, and DeltaABO (where O is the circumcenter ...

In the field of functional analysis, the Krein-Milman theorem is a result which characterizes all (nonempty) compact convex subsets K of "sufficiently nice" topological ...

The Kreisel conjecture is a conjecture in proof theory that postulates that, if phi(x) is a formula in the language of arithmetic for which there exists a nonnegative integer ...

The partial differential equation (u_t)/(u_x)=1/4(u_(xxx))/(u_x)-3/8(u_(xx)^2)/(u_x^2)+3/2(p(u))/(u_x^2), where p(u)=1/4(4u^3-g_2u-g_3). The special cases ...

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 ...

Given an m×n matrix A and a p×q matrix B, their Kronecker product C=A tensor B, also called their matrix direct product, is an (mp)×(nq) matrix with elements defined by ...

The most general form of this theorem states that in a commutative unit ring R, the height of every proper ideal I generated by n elements is at most n. Equality is attained ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...