Search Results for ""
2671 - 2680 of 13134 for Graph TheorySearch Results
For any sets A and B, their cardinal numbers satisfy |A|<=|B| iff there is a one-to-one function f from A into B (Rubin 1967, p. 266; Suppes 1972, pp. 94 and 116). It is easy ...
The term "Cartan algebra" has two meanings in mathematics, so care is needed in determining from context which meaning is intended. One meaning is a "Cartan subalgebra," ...
Let g be a finite-dimensional Lie algebra over some field k. A subalgebra h of g is called a Cartan subalgebra if it is nilpotent and equal to its normalizer, which is the ...
A method for verifying the correctness of an arithmetical operation on natural numbers, based on the same principle as casting out nines. The methods of sevens takes ...
An axiomatic system is said to be categorical if there is only one essentially distinct representation for it. In particular, the names and types of objects within the system ...
Let r and s be positive integers which are relatively prime and let a and b be any two integers. Then there is an integer N such that N=a (mod r) (1) and N=b (mod s). (2) ...
The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...
A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...
A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...
The approximation of a piecewise monotonic function f by a polynomial with the same monotonicity. Such comonotonic approximations can always be accomplished with nth degree ...
...
View search results from all Wolfram sites (33872 matches)

