Search Results for ""

The length of a number n in base b is the number of digits in the base-b numeral for n, given by the formula L(n,b)=|_log_b(n)_|+1, where |_x_| is the floor function. The ...

The great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...

An algebraic surface of surface order 4. Unlike cubic surfaces, quartic surfaces have not been fully classified. Examples of quartic surfaces include the apple surface, ...

Quantifier elimination is the removal of all quantifiers (the universal quantifier forall and existential quantifier exists ) from a quantified system. A first-order theory ...

The nth cubic number n^3 is a sum of n consecutive odd numbers, for example 1^3 = 1 (1) 2^3 = 3+5 (2) 3^3 = 7+9+11 (3) 4^3 = 13+15+17+19, (4) etc. This identity follows from ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

Informally, an elliptic curve is a type of cubic curve whose solutions are confined to a region of space that is topologically equivalent to a torus. The Weierstrass elliptic ...

The (signed) area of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) is A=1/2(|x_1 x_2; y_1 y_2|+|x_2 x_3; y_2 y_3|+...+|x_n x_1; y_n y_1|), ...

Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...