Search Results for ""

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

A topology tau on a topological vector space X=(X,tau) (with X usually assumed to be T2) is said to be locally convex if tau admits a local base at 0 consisting of balanced, ...

The problem of finding the strategy to guarantee reaching the boundary of a given region ("forest") in the shortest distance (i.e., a strategy having the best worst-case ...

A lozenge (or rhombus) algorithm is a class of transformation that can be used to attempt to produce series convergence improvement (Hamming 1986, p. 207). The best-known ...

There are two nonintersecting circles that are tangent to all three Lucas circles. (These are therefore the Soddy circles of the Lucas central triangle.) The inner one, ...

The M'Cay cubic Z(X_3) is a self-isogonal cubic given by the locus of all points whose pedal circle touches the nine-point circle, or equivalently, the locus of all points P ...

A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...

The game of nim appearing in Alain Resnais' film Last Year at Marienbad (L'année dernière à Marienbad, 1961). In Marienbad, two players alternately draw counters from one of ...

A sequence of random variates X_0, X_1, ... with finite means such that the conditional expectation of X_(n+1) given X_0, X_1, X_2, ..., X_n is equal to X_n, i.e., ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...