Search Results for ""

Let A be an n×n real square matrix with n>=2 such that |sum_(i=1)^nsum_(j=1)^na_(ij)s_it_j|<=1 (1) for all real numbers s_1, s_2, ..., s_n and t_1, t_2, ..., t_n such that ...

In hexagonal close packing, layers of spheres are packed so that spheres in alternating layers overlie one another. As in cubic close packing, each sphere is surrounded by 12 ...

Consider two mutually tangent (externally) spheres A and B together with a larger sphere C inside which A and B are internally tangent. Then construct a chain of spheres each ...

A graph G is a hypotraceable graph if G has no Hamiltonian path (i.e., it is not a traceable graph), but G-v has a Hamiltonian path (i.e., is a traceable graph) for every v ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

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 inverse of a square matrix A, sometimes called a reciprocal matrix, is a matrix A^(-1) such that AA^(-1)=I, (1) where I is the identity matrix. Courant and Hilbert (1989, ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...