Search Results for ""
3481 - 3490 of 13134 for Extremal graph theorySearch Results
An infinite set, such as the real numbers, which is not countably infinite.
A game in which a certain player can always win when he plays properly. All categorical games are unfair (Steinhaus 1999, p. 16), as is the game of Marienbad.
A group whose left Haar measure equals its right Haar measure.
A union-closed set is a nonempty finite collection of distinct nonempty finite sets which is closed under union.
An operator U satisfying U^|U = 1 (1) UU^| = 1, (2) where U^| is the adjoint.
The unitary group U_n(q) is the set of n×n unitary matrices.
A multiplicative character is called unitary if it has absolute value 1 everywhere.
The number 1. There are n nth roots of unity, known as the de Moivre numbers.
A function or transformation f in which f(z) does not overlap z. In modular function theory, a function is called univalent on a subgroup G if it is automorphic under G and ...
A position in a game is unsafe for player A if the person who plays next (player B) can win. Every unsafe position can be made safe by at least one move.
...
View search results from all Wolfram sites (34319 matches)

