Search Results for ""

Define O = lim_(->)O(n),F=R (1) U = lim_(->)U(n),F=C (2) Sp = lim_(->)Sp(n),F=H. (3) Then Omega^2BU = BU×Z (4) Omega^4BO = BSp×Z (5) Omega^4BSp = BO×Z. (6)

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A highly structured geometric object used to study groups which act upon them.

A C^*-algebra is a Banach algebra with an antiautomorphic involution * which satisfies (x^*)^* = x (1) x^*y^* = (yx)^* (2) x^*+y^* = (x+y)^* (3) (cx)^* = c^_x^*, (4) where ...

A function f is Carathéodory differentiable at a if there exists a function phi which is continuous at a such that f(x)-f(a)=phi(x)(x-a). Every function which is Carathéodory ...

The centralizer of an element z of a group G is the set of elements of G which commute with z, C_G(z)={x in G,xz=zx}. Likewise, the centralizer of a subgroup H of a group G ...

A fake knot (i.e., a knot equivalent to the unknot) created by tying a square knot, then looping one end twice through the knot such that when both ends are pulled, the knot ...

A node which is one graph edge further away from a given node in a rooted tree.

A Chu space is a binary relation from a set A to an antiset X which is defined as a set which transforms via converse functions.

A partially ordered set P is a circle order if it is isomorphic to a set of disks ordered by containment.