Search Results for ""

A set X is a called a "convex cone" if for any x,y in X and any scalars a>=0 and b>=0, ax+by in X.

The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...

The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...

Consider the expression 3×7+2^2. This expression has value (3×7)+(2^2)=25 due to what is called operator precedence (or "order of operations"). Precedence of common operators ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...

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 ...

The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...

The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...

Given a set A, let N(A) be the set of neighbors of A. Then the bipartite graph G with bipartitions X and Y has a perfect matching iff |N(A)|>=|A| for all subsets A of X.

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.