TOPICS
Search

Search Results for ""


211 - 220 of 371 for Permutation combinationsSearch Results
Determinants are mathematical objects that are very useful in the analysis and solution of systems of linear equations. As shown by Cramer's rule, a nonhomogeneous system of ...
The Dürer folium is a special case of the rose curve with n=1. It is therefore also an epitrochoid. It has polar equation r=asin(theta/2) (1) and can be written as a ...
A structure consisting of an ordered set of sorted lists such that the head and tail entries of later lists nest within earlier ones. For example, an encroaching list set for ...
A generalization of Turán's theorem to non-complete graphs.
The four parameters e_0, e_1, e_2, and e_3 describing a finite rotation about an arbitrary axis. The Euler parameters are defined by e_0 = cos(phi/2) (1) e = [e_1; e_2; e_3] ...
The exterior derivative of a function f is the one-form df=sum_(i)(partialf)/(partialx_i)dx_i (1) written in a coordinate chart (x_1,...,x_n). Thinking of a function as a ...
Let C=C^+ union C^- (where C^+ intersection C^-=emptyset) be the disjoint union of two finite components C^+ and C^-. Let alpha and beta be two involutions on C, each of ...
A generalization of the equation whose solution is desired in Fermat's last theorem x^n+y^n=z^n to x^n+y^n=cz^n for x, y, z, and c positive constants, with trivial solutions ...
There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...
A cycle of a finite group G is a minimal set of elements {A^0,A^1,...,A^n} such that A^0=A^n=I, where I is the identity element. A diagram of a group showing every cycle in ...
1 ... 19|20|21|22|23|24|25 ... 38 Previous Next

...