Search Results for ""

The sequence of numbers which are sums of distinct powers of 4. The first few are 0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, ... (OEIS A000695). These numbers ...

Müntz's theorem is a generalization of the Weierstrass approximation theorem, which states that any continuous function on a closed and bounded interval can be uniformly ...

Symbols used to identify irreducible representations of groups: A= singly degenerate state which is symmetric with respect to rotation about the principal C_n axis, B= singly ...

The neighborhood graph of a given graph from a vertex v is the subgraph induced by the neighborhood of a graph from vertex v, most commonly including v itself. Such graphs ...

A Lie algebra is nilpotent when its Lie algebra lower central series g_k vanishes for some k. Any nilpotent Lie algebra is also solvable. The basic example of a nilpotent Lie ...

A nilpotent Lie group is a Lie group G which is connected and whose Lie algebra is a nilpotent Lie algebra g. That is, its Lie algebra lower central series ...

A polyhedral graph having nine vertices. There are 2606 nonisomorphic nonahedral graphs, as first enumerated by Federico (1969; Duijvestijn and Federico 1981). Named ...

An odd number is an integer of the form n=2k+1, where k is an integer. The odd numbers are therefore ..., -3, -1, 1, 3, 5, 7, ... (OEIS A005408), which are also the gnomonic ...

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

An outerplanar graph is a graph that can be embedded in the plane such that all vertices lie on the outer face. Outerplanar graphs are planar and, by their definition, ...