Search Results for ""
3071 - 3080 of 6485 for Finite Group D 4Search Results
Given a smooth manifold M with an open cover U_i, a partition of unity subject to the cover U_i is a collection of smooth, nonnegative functions psi_i, such that the support ...
A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...
The Robertson-Seymour theorem, also called the graph minor theorem, is a generalization of the Kuratowski reduction theorem by Robertson and Seymour, which states that the ...
A commutative Noetherian unit ring having only finitely many maximal ideals. A ring having the same properties except Noetherianity is called quasilocal. If K is a field, the ...
A species of structures is a rule F which 1. Produces, for each finite set U, a finite set F[U], 2. Produces, for each bijection sigma:U->V, a function F[sigma]:F[U]->F[V]. ...
Let any finite or infinite set of points having no finite limit point be prescribed, and associate with each of its points a definite positive integer as its order. Then ...
A version of set theory which is a formal system expressed in first-order predicate logic. Zermelo-Fraenkel set theory is based on the Zermelo-Fraenkel axioms. ...
A Chen prime is a prime number p for which p+2 is either a prime or semiprime. Chen primes are named after Jing Run Chen who proved in 1966 that there are infinitely many ...
The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...
A module is a mathematical object in which things can be added together commutatively by multiplying coefficients and in which most of the rules of manipulating vectors hold. ...
...
View search results from all Wolfram sites (352745 matches)

