Search Results for ""
481 - 490 of 13134 for decoherence theorySearch Results
A fork of a tree T is a node of T which is the endpoint of two or more branches.
A closed curve associated with a knot which is displaced along the normal by a small amount. For a knot K parameterized as x^mu(s) for 0<=s<=L along the length of the knot by ...
Consider a finite collection of points p=(p_1,...,p_n), p_i in R^d Euclidean space (known as a configuration) and a graph G whose graph vertices correspond to pairs of points ...
The free product G*H of groups G and H is the set of elements of the form g_1h_1g_2h_2...g_rh_r, where g_i in G and h_i in H, with g_1 and h_r possibly equal to e, the ...
The Frobenius equation is the Diophantine equation a_1x_1+a_2x_2+...+a_nx_n=b, where the a_i are positive integers, b is an integer, and the solutions x_i are nonnegative ...
Let C_(L,M) be a Padé approximant. Then C_((L+1)/M)S_((L-1)/M)-C_(L/(M+1))S_(L/(M+1)) = C_(L/M)S_(L/M) (1) C_(L/(M+1))S_((L+1)/M)-C_((L+1)/M)S_(L/(M+1)) = ...
The solution to a game in game theory. When a game saddle point is present max_(i<=m)min_(j<=n)a_(ij)=min_(j<=n)max_(i<=m)a_(ij)=v, and v is the value for pure strategies.
The golden ratio conjugate, also called the silver ratio, is the quantity Phi = 1/phi (1) = phi-1 (2) = 2/(1+sqrt(5)) (3) = (sqrt(5)-1)/2 (4) = 0.6180339887... (5) (OEIS ...
An arc of a graph, sometimes also called a flag, is an ordered pair of adjacent vertices (Godsil and Royle 2001, p. 59), sometimes also called a directed line (Harary 1994, ...
A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.
...