TOPICS
Search

Search Results for ""


10651 - 10660 of 13135 for OTHER ADVANCED ALGEBRASearch Results
Steiner gave and Droz-Farny (1901) proved that if equal circles are drawn about the vertices of a triangle (dashed circles in the above figure), they cut the lines joining ...
The triangle DeltaN_1N_2N_3 formed by joining a set of three Neuberg centers (i.e., centers of the Neuberg circles) obtained from the edges of a given triangle DeltaA_1A_2A_3 ...
The fish curve is a term coined in this work for the ellipse negative pedal curve with pedal point at the focus for the special case of the eccentricity e^2=1/2. For an ...
The determination of a test for the equality of means for two normal distributions with different variances given samples from each. There exists an exact test which, ...
Fisher's exact test is a statistical test used to determine if there are nonrandom associations between two categorical variables. Let there exist two such variables X and Y, ...
A diagram lemma which states that, given the commutative diagram of additive Abelian groups with exact rows, the following holds: 1. If f_0 is surjective, and f_1 and f_3 are ...
A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...
Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...
Given a system of ordinary differential equations of the form d/(dt)[x; y; v_x; v_y]=-[0 0 -1 0; 0 0 0 -1; Phi_(xx)(t) Phi_(yx)(t) 0 0; Phi_(xy)(t) Phi_(yy)(t) 0 0][x; y; ...
Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

...