TOPICS
Search

Search Results for ""


2901 - 2910 of 13134 for complexity theorySearch Results
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 graph in which individual nodes have no distinct identifications except through their interconnectivity. Graphs in which labels (which are most commonly numbers) are ...
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.
The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.
A "visual representation" number which is a sum of some simple function of its digits. For example, 1233 = 12^2+33^2 (1) 2661653 = 1653^2-266^2 (2) 221859 = 22^3+18^3+59^3 ...
1 ... 288|289|290|291|292|293|294 ... 1314 Previous Next

...