Search Results for ""
8211 - 8220 of 8520 for Inline 1Search Results
View search results from all Wolfram sites (501409 matches)Analysis
The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...
von Neumann-Bernays-Gödel set theory (abbreviated "NBG") is a version of set theory which was designed to give the same results as Zermelo-Fraenkel set theory, but in a more ...
Given a Hilbert space H, a *-subalgebra A of B(H) is said to be a von Neumann algebra in H provided that A is equal to its bicommutant A^('') (Dixmier 1981). Here, B(H) ...
The term "arbelos" means shoemaker's knife in Greek, and this term is applied to the shaded area in the above figure which resembles the blade of a knife used by ancient ...
The game of billiards is played on a rectangular table (known as a billiard table) upon which balls are placed. One ball (the "cue ball") is then struck with the end of a ...
The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...
The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...
The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...
The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...
...