TOPICS
Search

Search Results for ""


1221 - 1230 of 2006 for Graph entropySearch Results
A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...
The Ricci flow equation is the evolution equation d/(dt)g_(ij)(t)=-2R_(ij) for a Riemannian metric g_(ij), where R_(ij) is the Ricci curvature tensor. Hamilton (1982) showed ...
The tribonacci constant is ratio to which adjacent tribonacci numbers tend, and is given by t = (x^3-x^2-x-1)_1 (1) = 1/3(1+RadicalBox[{19, -, 3, {sqrt(, 33, )}}, ...
One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...
LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...
If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...
The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...
The Loupekine snarks are the two snarks on 22 vertices and 33 edges illustrated above. They are implemented in the Wolfram Language as GraphData["LoupekineSnark1"] and ...
The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...
There are several versions of the Kaplan-Yorke conjecture, with many of the higher dimensional ones remaining unsettled. The original Kaplan-Yorke conjecture (Kaplan and ...
1 ... 120|121|122|123|124|125|126 ... 201 Previous Next

...