Search Results for ""

The angles S_1=A_1/2 and S_2=A_2/2 obtained from solving sin(x+omega)=2sinomega (1) for x=A_1,A_2, where omega is the Brocard angle. The half-angles A_1 and A_2 are given by ...

A relation < is a strict order on a set S if it is 1. Irreflexive: a<a does not hold for any a in S. 2. Asymmetric: if a<b, then b<a does not hold. 3. Transitive: a<b and b<c ...

Summation by parts for discrete variables is the equivalent of integration by parts for continuous variables Delta^(-1)[v(x)Deltau(x)]=u(x)v(x)-Delta^(-1)[Eu(x)Deltav(x)], ...

An n×n array of the integers from 1 to n^2 such that the difference between any one integer and its neighbor (horizontally, vertically, or diagonally, without wrapping ...

A number of attractive 50-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

The function psi(x)={x(1-(x^2)/(c^2))^2 for |x|<c; 0 for |x|>c (1) sometimes used in robust estimation. It has a minimum at x=-c/sqrt(5) and a maximum at x=c/sqrt(5), where ...

The base-20 notational system for representing real numbers. The digits used to represent numbers using vigesimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F, ...

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...

Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...