Search Results for ""

The constants lambda_(m,n)=inf_(r in R_(m,n))sup_(x>=0)|e^(-x)-r(x)|, where r(x)=(p(x))/(q(x)), p and q are mth and nth order polynomials, and R_(m,n) is the set of all ...

The extangents triangle is homothetic to the orthic triangle, and its homothetic center is known as the Clawson point, or sometimes the "crucial point." It has equivalent ...

A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of ...

A concordant form is an integer triple (a,b,N) where {a^2+b^2=c^2; a^2+Nb^2=d^2, (1) with c and d integers. Examples include {14663^2+111384^2=112345^2; ...

In 1989, P. Yff proved there is a unique configuration of isoscelizers for a given triangle such that all three have the same length and are concurrent (C. Kimberling, pers. ...

The automorphism group Co_1 of the Leech lattice modulo a center of order two is called "the" Conway group. There are 15 exceptional conjugacy classes of the Conway group. ...

There are a number of attractive cube 20-compounds that can be constructed by taking the duals of the octahedra in the two octahedron 20-compounds. The second of these was ...

There are a number of attractive cube 25-compounds. One can be constructed from the vertices of the second dodecahedron 6-compound (or second tetrahedron 50-compound) and ...

A special case of Stokes' theorem in which F is a vector field and M is an oriented, compact embedded 2-manifold with boundary in R^3, and a generalization of Green's theorem ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...