Search Results for ""

The centroid is center of mass of a two-dimensional planar lamina or a three-dimensional solid. The mass of a lamina with surface density function sigma(x,y) is ...

An algorithm for finding closed form hypergeometric identities. The algorithm treats sums whose successive terms have ratios which are rational functions. Not only does it ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

A Heronian tetrahedron, also called a perfect tetrahedron, is a (not necessarily regular) tetrahedron whose sides, face areas, and volume are all rational numbers. It ...

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 lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

The resolution principle, due to Robinson (1965), is a method of theorem proving that proceeds by constructing refutation proofs, i.e., proofs by contradiction. This method ...

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...