Search Results for ""

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.

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

If A is a class of recursively enumerable sets, then the set of Gödel numbers of functions whose domains belong to A is called its index set. If the index set of A is a ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any set a and a formula A(y) of a set x consisting of all elements of a satisfying A(y), exists x ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

The term "natural number" refers either to a member of the set of positive integers 1, 2, 3, ... (OEIS A000027) or to the set of nonnegative integers 0, 1, 2, 3, ... (OEIS ...