Search Results for ""

A function f which may (but does not necessarily) associate a given member of the range of f with more than one member of the domain of f. For example, trigonometric ...

An algorithm which constructs allowed mathematical statements from simple ingredients.

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

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

A set considered together with the sigma-algebra on the set.

A set M of all polynomials in s variables, x_1, ..., x_s such that if P, P_1, and P_2 are members, then so are P_1+P_2 and QP, where Q is any polynomial in x_1, ..., x_s.

A strong inequality in which a is not only less than b, but much less (by some convention) is denoted a<<b.

A 10000-sided polygon.

mu_i(epsilon), sometimes denoted P_i(epsilon), is the probability that element i is populated, normalized such that sum_(i=1)^Nmu_i(epsilon)=1.

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...