Search Results for ""

In general, an arrangement of objects is simply a grouping of them. The number of "arrangements" of n items is given either by a combination (order is ignored) or permutation ...

Arrow's paradox, also called Arrow's impossibility theorem or the general possibility theorem, states that perfect democratic voting is impossible, not just in practice but ...

A module that fulfils the descending chain condition with respect to inclusion, i.e., if every decreasing sequence of submodules eventually become constant.

Suppose that E(G) (the commuting product of all components of G) is simple and G contains a semisimple group involution. Then there is some semisimple group involution x such ...

A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...

Asymptotic behavior. A useful yet endangered word, found rarely outside the captivity of the Oxford English Dictionary (Simpson and Weiner 1992, p. 82).

An asymptote is a line or curve that approaches a given curve arbitrarily closely, as illustrated in the above diagram. The plot above shows 1/x, which has a vertical ...

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...

A pattern tau=(tau_1,...,tau_n) is said to avoid alpha=(alpha_1,...,alpha_k) if alpha is not contained in tau. In other words, tau avoids alpha iff no k-subset of tau is ...

The Balthasart projection is a cylindrical equal-area projection that uses a standard parallel of phi_s=50 degrees.