Search Results for ""

A term sometimes used to describe a map projection which is neither equal-area nor conformal (Lee 1944; Snyder 1987, p. 4).

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.

Let (X,tau) be a topological space, and let p in X. Then the arc component of p is union {A subset= X:A is an arc and p in A}.

Barycentric coordinates (t_1,t_2,t_3) normalized so that they become the areas of the triangles PA_1A_2, PA_1A_3, and PA_2A_3, where P is the point whose coordinates have ...

The sequence whose definition is: "t is the first, fourth, eleventh, ... letter of this sentence." The first few values are 1, 4, 11, 16, 24, 29, 33, 35, 39, ... (OEIS ...

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).