Search Results for ""

An important theorem in plane geometry, also known as Hero's formula. Given the lengths of the sides a, b, and c and the semiperimeter s=1/2(a+b+c) (1) of a triangle, Heron's ...

The Jacobi polynomials, also known as hypergeometric polynomials, occur in the study of rotation groups and in the solution to the equations of motion of the symmetric top. ...

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...

Keller conjectured that tiling an n-dimensional space with n-dimensional hypercubes of equal size yields an arrangement in which at least two hypercubes have an entire ...

Let L=<L, v , ^ > and K=<K, v , ^ > be lattices, and let h:L->K. Then h is a lattice homomorphism if and only if for any a,b in L, h(a v b)=h(a) v h(b) and h(a ^ b)=h(a) ^ ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

The necker cube is an illusion in which a two-dimensional drawing of an array of cubes appears to simultaneously protrude from and intrude into the page. A Necker cube ...

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...