TOPICS
Search

Search Results for ""


451 - 460 of 580 for Tree diagramsSearch Results
There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...
Two triangles are said to be poristic triangles if they share the same incircle and circumcircle. More specifically, in the plane of a reference triangle, a triangle is said ...
A primitive right triangle is a right triangle having integer sides a, b, and c such that GCD(a,b,c)=1, where GCD(a,b,c) is the greatest common divisor. The set of values ...
A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...
A configuration of 12 planes and 12 points such that six points lie in every plane and six planes pass through every point. Alternatively, the configuration consists of 16 ...
The spherical curve obtained when moving along the surface of a sphere with constant speed, while maintaining a constant angular velocity with respect to a fixed diameter ...
A species of structures is a rule F which 1. Produces, for each finite set U, a finite set F[U], 2. Produces, for each bijection sigma:U->V, a function F[sigma]:F[U]->F[V]. ...
The Lie derivative of a spinor psi is defined by L_Xpsi(x)=lim_(t->0)(psi^~_t(x)-psi(x))/t, where psi^~_t is the image of psi by a one-parameter group of isometries with X ...
For two random variates X and Y, the correlation is defined bY cor(X,Y)=(cov(X,Y))/(sigma_Xsigma_Y), (1) where sigma_X denotes standard deviation and cov(X,Y) is the ...
The Steenrod algebra has to do with the cohomology operations in singular cohomology with integer mod 2 coefficients. For every n in Z and i in {0,1,2,3,...} there are ...
1 ... 43|44|45|46|47|48|49 ... 58 Previous Next

...