Search Results for ""

Let A be a C^*-algebra, then two element a,b of A are called unitarily equivalent if there exists a unitary u in A such that b=uau^*.

An aliquot sequence computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

The quantifier "for all" ( forall ), sometimes also known as the "general quantifier."

A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...

A position in a game is unsafe for player A if the person who plays next (player B) can win. Every unsafe position can be made safe by at least one move.

The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.

Let theta be the angle between two vectors. If 0<theta<pi, the vectors are positively oriented. If pi<theta<2pi, the vectors are negatively oriented. Two vectors in the plane ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

The partial differential equation iu_t+[(1+|u|^2u)^(-1/2)u]_(xx)=0.

Wagner's theorem states that a graph is planar iff it does not contain K_5 or K_(3,3) as a graph minor.