Search Results for ""

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...

Suppose that X is a vector space over the field of complex or real numbers. Then the set of all linear functionals on X forms a vector space called the algebraic conjugate ...

Given a field F and an extension field K superset= F, an element alpha in K is called algebraic over F if it is a root of some nonzero polynomial with coefficients in F. ...

Let K be a field, and A a K-algebra. Elements y_1, ..., y_n are algebraically independent over K if the natural surjection K[Y_1,...,Y_n]->K[y_1,...,y_n] is an isomorphism. ...

Consider the circle map. If K is nonzero, then the motion is periodic in some finite region surrounding each rational Omega. This execution of periodic motion in response to ...

A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...

An integer n is p-balanced for p a prime if, among all nonzero binomial coefficients (n; k) for k=0, ..., n (mod p), there are equal numbers of quadratic residues and ...

A Banach algebra is an algebra B over a field F endowed with a norm ||·|| such that B is a Banach space under the norm ||·|| and ||xy||<=||x||||y||. F is frequently taken to ...

Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...

The bead-sorting algorithm orders a list of a positive integers increasingly by representing numbers as a list of a 1s, where each 1 stands for a bead. The k initial integers ...