Search Results for ""

A number of the form p^a·A is said to be an antisquare if it fails to be a square number for the two reasons that a is odd and A is a nonsquare (modulo p). The first few ...

A relation R on a set S is antisymmetric provided that distinct elements are never both related to one another. In other words xRy and yRx together imply that x=y.

An operator A^~ is said to be antiunitary if it satisfies: <A^~f_1|A^~f_2> = <f_1|f_2>^_ (1) A^~[f_1(x)+f_2(x)] = A^~f_1(x)+A^~f_2(x) (2) A^~cf(x) = c^_A^~f(x), (3) where ...

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

An anyon is a projective representation of a Lie group.

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

Araya and Wiener (2011) found the two cubic planar hypohamiltonian graphs on 70 and 88 vertices, respectively, illustrated above.

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

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