TOPICS
Search

Search Results for ""


311 - 320 of 13134 for catastrophe theorySearch Results
The unknot, also called the trivial knot (Rolfsen 1976, p. 51), is a closed loop that is not knotted. In the 1930s Reidemeister first proved that knots exist which are ...
A finite division algebra is a field.
The double-struck capital letter I, I, is a symbol sometimes used instead of Z for the ring of integers. In contrast, the lower case symbol i is used to refer to the ...
Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...
The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...
The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...
A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...
"The" Jacobi identity is a relationship [A,[B,C]]+[B,[C,A]]+[C,[A,B]]=0,, (1) between three elements A, B, and C, where [A,B] is the commutator. The elements of a Lie algebra ...
Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.
One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.
1 ... 29|30|31|32|33|34|35 ... 1314 Previous Next

...