Search Results for ""

The term "higher dimensional group theory" was introduced by Brown (1982), and refers to a method for obtaining new homotopical information by generalizing to higher ...

The study of number fields by embedding them in a local field is called local class field theory. Information about an equation in a local field may give information about ...

For a Galois extension field K of a field F, the fundamental theorem of Galois theory states that the subgroups of the Galois group G=Gal(K/F) correspond with the subfields ...

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

Let N^* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n>=N^*, a complete graph K_4 of one color with ...

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

The multiplicity of a multigraph is its maximum edge multiplicity.

von Neumann-Bernays-Gödel set theory (abbreviated "NBG") is a version of set theory which was designed to give the same results as Zermelo-Fraenkel set theory, but in a more ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.