Search Results for ""
3091 - 3100 of 13134 for Class field theorySearch Results
1000=10^3. The word "thousand" appears in common expressions in a number of languages, for example, "a thousand pardons" in English and "tusen takk" ("a thousand thanks") in ...
A three-colorable graph G is a graph with chromatic number chi(G)<=3.
The operation of multiplication, i.e., a times b. Various notations are a×b, a·b, a*b, ab, and (a)(b). The "multiplication sign" × is based on Saint Andrew's cross (Bergamini ...
A strategy for the iterated prisoner's dilemma in which a prisoner cooperates on the first move, and thereafter copies the previous move of the other prisoner. Any better ...
A simple unlabeled graph whose connectivity is considered purely on the basis of topological equivalence, so that two edges (v_1,v_2) and (v_2,v_3) joined by a node v_2 of ...
A topological groupoid over B is a groupoid G such that B and G are topological spaces and alpha,beta, and multiplication are continuous maps. Here, alpha and beta are maps ...
One of a set of numbers defined in terms of an invariant generated by the finite cyclic covering spaces of a knot complement. The torsion numbers for knots up to 9 crossings ...
A relation on a totally ordered set.
A sequence of moves (i.e., a path) on a chessboard by a chess piece in which each square of a chessboard is visited exactly once.
A tournament sequence is an increasing sequence of positive integers (t_1, t_2, ...) such that t_1=1 and t_(i+1)<=2t_i. Cook and Kleber (2000) show that Meeussen sequences ...
...
View search results from all Wolfram sites (33218 matches)

