TOPICS
Search

Search Results for ""


1561 - 1570 of 2466 for Third_fundamental_formSearch Results
The ordered pair (s,t), where s is the number of real embeddings of the number field and t is the number of complex-conjugate pairs of embeddings. The degree of the number ...
If G is a weighted tree with weights w_i>1 assigned to each vertex v_i, then G is perfectly weighted if the matrix M_G=[w_1 0 ... 0; 0 w_2 ... 0; | ... ... |; 0 0 ... ...
A polar representation of a complex measure mu is analogous to the polar representation of a complex number as z=re^(itheta), where r=|z|, dmu=e^(itheta)d|mu|. (1) The analog ...
A principal nth root omega of unity is a root satisfying the equations omega^n=1 and sum_(i=0)^(n-1)omega^(ij)=0 for j=1, 2, ..., n. Therefore, every primitive root of unity ...
A principle that was first enunciated by Jakob Bernoulli which states that if we are ignorant of the ways an event can occur (and therefore have no reason to believe that one ...
"Q.E.D." (sometimes written "QED") is an abbreviation for the Latin phrase "quod erat demonstrandum" ("that which was to be demonstrated"), a notation which is often placed ...
A repeated integral is an integral taken multiple times over a single variable (as distinguished from a multiple integral, which consists of a number of integrals taken with ...
The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas ...
A topological space X is semilocally simply connected (also called semilocally 1-connected) if every point x in X has a neighborhood U such that any loop L:[0,1]->U with ...
A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...
1 ... 154|155|156|157|158|159|160 ... 247 Previous Next

...