Search Results for ""

A subset B of a vector space E is said to be absorbing if for any x in E, there exists a scalar lambda>0 such that x in muB for all mu in F with |mu|>=lambda, where F is the ...

An addition chain for a number n is a sequence 1=a_0<a_1<...<a_r=n, such that each member after a_0 is the sum of two earlier (not necessarily distinct) ones. The number r is ...

The set theory symbol (aleph) for the cardinal number of a well-orderable infinite set.

A congruence of the form f(x)=0 (mod n) where f(x) is an integer polynomial (Nagell 1951, p. 73).

A category of link encompassing both alternating knots and torus knots.

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

A number which can be represented both in the form x_0^2-Dy_0^2 and in the form Dx_1^2-y_1^2. This is only possible when the Pell equation x^2-Dy^2=-1 (1) is solvable. Then ...

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].

A vaguely defined branch of mathematics dealing with varieties, the Mordell conjecture, Arakelov theory, and elliptic curves.

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