TOPICS
Search

Search Results for ""


31 - 40 of 322 for Show AllSearch Results
An algebraic loop L is a Moufang loop if all triples of elements x, y, and z in L satisfy the Moufang identities, i.e., if 1. z(x(zy))=((zx)z)y, 2. x(z(yz))=((xz)y)z, 3. ...
A plot of the cells on a grid satisfying bitwise XOR(a,b)<n for consecutive values of n=1, 2, .... It is thought that it was discovered by Jackson Wright on the RLE PDP-1 ...
A *-algebra A of operators on a Hilbert space H is said to act nondegenerately if whenever Txi=0 for all T in A, it necessarily implies that xi=0. Algebras A which act ...
Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...
Measurements of a centered convex body in Euclidean n-space (for n>=3) show that its brightness function (the volume of each projection) is smaller than that of another such ...
A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...
A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...
The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...
Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a local polarity if and only if for each finite set X subset= L, there is a finitely generated ...
The Hatzel graph is a planar hypohamiltonian graph on 57 vertices that was the smallest known example of such a graph until the discovery of the Zamfirescu graph on 48 ...
1|2|3|4|5|6|7 ... 33 Previous Next

...