Search Results for ""

Eternity is a puzzle devised by Christopher Monckton and consisting of 209 pieces, each of which is a 12-polydrafter (i.e., a compound of 30-60-90 triangles). The puzzle was ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

The Euler triangle of a triangle DeltaABC is the triangle DeltaE_AE_BE_C whose vertices are the midpoints of the segments joining the orthocenter H with the respective ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...

Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

The following are equivalent definitions for a Galois extension field (also simply known as a Galois extension) K of F. 1. K is the splitting field for a collection of ...

Let L be an extension field of K, denoted L/K, and let G be the set of automorphisms of L/K, that is, the set of automorphisms sigma of L such that sigma(x)=x for every x in ...

The generalized Gell-Mann matrices are the n^2-1 matrices generating the Lie algebra associated to the special unitary group SU(n), n>=2. As their name suggests, these ...