Search Results for ""

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

The equations defined by q^. = (partialH)/(partialp) (1) p^. = -(partialH)/(partialq), (2) where p^.=dp/dt and q^.=dq/dt is fluxion notation and H is the so-called ...

It is always possible to write a sum of sinusoidal functions f(theta)=acostheta+bsintheta (1) as a single sinusoid the form f(theta)=ccos(theta+delta). (2) This can be done ...

Let a straight line AB be divided internally at C and externally at D in the same ratio, so that (AC)/(CB)=-(AD)/(DB). Then AB is said to be divided harmonically at C and D ...

A partial differential diffusion equation of the form (partialU)/(partialt)=kappadel ^2U. (1) Physically, the equation commonly arises in situations where kappa is the ...

The hemicube, which might also be called the square hemiprism, is a simple solid that serves as an example of one of the two topological classes of convex hexahedron having 7 ...

A heterosquare is an n×n array of the integers from 1 to n^2 such that the rows, columns, and diagonals have different sums. (By contrast, in a magic square, they have the ...

The Gelfond-Schneider constant is sometimes known as the Hilbert number. Flannery and Flannery (2000, p. 35) define a Hilbert number as a positive integer of the form n=4k+1 ...