Search Results for ""

A generalization of Turán's theorem to non-complete graphs.

An exact sequence is a sequence of maps alpha_i:A_i->A_(i+1) (1) between a sequence of spaces A_i, which satisfies Im(alpha_i)=Ker(alpha_(i+1)), (2) where Im denotes the ...

An exponential moving average, also known as an exponentially weighted moving average and abbreviated EMA or EWMA, is a moving filter that applied weights to older values in ...

Given a subset K of a vector space X, a nonempty subset S subset K is called an extreme set of K if no point of S is an internal point of any line interval whose endpoints ...

The Faulkner-Younger graphs (Faulkner and Younger 1974) are the cubic polyhedral nonhamiltonian graphs on 42 and 44 vertices illustrated above that are counterexamples to ...

A formula for numerical integration, (1) where C_(2n) = sum_(i=0)^(n)f_(2i)cos(tx_(2i))-1/2[f_(2n)cos(tx_(2n))+f_0cos(tx_0)] (2) C_(2n-1) = ...

An extension field F subset= K is called finite if the dimension of K as a vector space over F (the so-called degree of K over F) is finite. A finite field extension is ...

A diagram lemma which states that, given the above commutative diagram with exact rows, the following holds: 1. If alpha is surjective, and beta and delta are injective, then ...

A group is called a free group if no relation exists between its group generators other than the relationship between an element and its inverse required as one of the ...

In general, a frieze consists of repeated copies of a single motif. b ; a d; c Conway and Guy (1996) define a frieze pattern as an arrangement of numbers at the intersection ...