Search Results for ""

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...

If f(x) is a nonconstant integer polynomial and c is an integer such that f(c) is divisible by the prime p, that p is called a prime divisor of the polynomial f(x) (Nagell ...

If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...

An algebraic expression in variables {x_1,...,x_n} is an expression constructed with the variables and algebraic numbers using addition, multiplication, and rational powers.

Any tangle obtained by additions and multiplications of rational tangles (Adams 1994).

The intersection product for classes of rational equivalence between cycles on an algebraic variety.

A distribution of error such that the error remaining is always given approximately by the last term dropped.

An algebraic equation is algebraically solvable iff its group is solvable. In order that an irreducible equation of prime degree be solvable by radicals, it is necessary and ...

Let f be an integer polynomial. The f can be factored into a product of two polynomials of lower degree with rational coefficients iff it can be factored into a product of ...

The necessary and sufficient condition that an algebraic curve has an algebraic involute is that the arc length is a two-valued algebraic function of the coordinates of the ...