Search Results for ""

A notation used to describe curves. The fundamental principle of Clebsch-Aronhold notation states that if each of a number of forms be replaced by a power of a linear form in ...

The colon is the symbol ":". It is used in a number of different ways in mathematics. 1. To denote ratio or odds, as in 2:1 (voiced "two to one"). 2. To mean such that in ...

A curve of order n is generally determined by n(n+3)/2 points. So a conic section is determined by five points and a cubic curve should require nine. But the Maclaurin-Bézout ...

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

The operator partial^_ is defined on a complex manifold, and is called the 'del bar operator.' The exterior derivative d takes a function and yields a one-form. It decomposes ...

The number 2^(1/3)=RadicalBox[2, 3] (the cube root of 2) which is to be constructed in the cube duplication problem. This number is not a Euclidean number although it is an ...

The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...

For any alpha in A (where A denotes the set of algebraic numbers), let |alpha|^_ denote the maximum of moduli of all conjugates of alpha. Then a function ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

A group action G×X->X is effective if there are no trivial actions. In particular, this means that there is no element of the group (besides the identity element) which does ...