Search Results for ""

One of the polynomials obtained by taking powers of the Brahmagupta matrix. They satisfy the recurrence relation x_(n+1) = xx_n+tyy_n (1) y_(n+1) = xy_n+yx_n. (2) A list of ...

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 sequence is an ordered set of mathematical objects. Sequences of object are most commonly denoted using braces. For example, the symbol {2n}_(n=1)^infty denotes the ...

The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

The use of permil (a.k.a. parts per thousand) is a way of expressing ratios in terms of whole numbers. Given a ratio or fraction, it is converted to a permil-age by ...

The use of permil (a.k.a. parts per thousand) is a way of expressing ratios in terms of whole numbers. Given a ratio or fraction, it is converted to a permil-age by ...

A colossally abundant number is a positive integer n for which there is a positive exponent epsilon such that (sigma(n))/(n^(1+epsilon))>=(sigma(k))/(k^(1+epsilon)) for all ...

Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...