Search Results for ""
1041 - 1050 of 1403 for Compact groupSearch Results
The quaternions are members of a noncommutative division algebra first invented by William Rowan Hamilton. The idea for quaternions occurred to him while he was walking along ...
RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...
The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...
A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...
Triskaidekaphobia is the fear of 13, a number commonly associated with bad luck in Western culture. While fear of the number 13 can be traced back to medieval times, the word ...
A ring in the mathematical sense is a set S together with two binary operators + and * (commonly interpreted as addition and multiplication, respectively) satisfying the ...
The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...
A hyperbolic knot is a knot that has a complement that can be given a metric of constant curvature -1. All hyperbolic knots are prime knots (Hoste et al. 1998). A prime knot ...
The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...
A prime p is said to be a Sophie Germain prime if both p and 2p+1 are prime. The first few Sophie Germain primes are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, ... (OEIS ...
...
View search results from all Wolfram sites (16533 matches)

