Search Results for ""

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.

Construct a chain C of 2n components in a solid torus V. Now thicken each component of C slightly to form a chain C_1 of 2n solid tori in V, where pi_1(V-C_1)=pi_1(V-C) via ...

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

The area element for a surface with first fundamental form ds^2=Edu^2+2Fdudv+Gdv^2 is dA=sqrt(EG-F^2)du ^ dv, where du ^ dv is the wedge product.

The arithmetic mean of a set of values is the quantity commonly called "the" mean or the average. Given a set of samples {x_i}, the arithmetic mean is x^_=1/Nsum_(i=1)^Nx_i. ...

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

Let n be a positive nonsquare integer. Then Artin conjectured that the set S(n) of all primes for which n is a primitive root is infinite. Under the assumption of the ...

Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...

A Sheffer sequence for (1,f(t)) is called the associated sequence for f(t), and a sequence s_n(x) of polynomials satisfying the orthogonality conditions ...

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