Search Results for ""

Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...

The central point in a wheel graph W_n. The hub has degree n-1.

A sextic surface given by the implicit equation 4(x^2+y^2+z^2-13)^3+27(3x^2+y^2-4z^2-12)^2=0.

A two-player game in which player 1 chooses any finite game and player 2 moves first. A pseudoparadox then arises as to whether the hypergame is itself a finite game.

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.

A hyperstring is a simple semi-Hamiltonian acyclic digraph (V,E) with a labeling of the edges in E such that, for all vertices i,j,p,q in V, either pi(i,j)=pi(p,q) or pi(i,j) ...

The term "ice fractal" refers to a fractal (square, triangle, etc.) that is based on a simple generating motif. The above plots show the ice triangle, antitriangle, square, ...

A game in which the possible moves are the same for each player in any position. All positions in all impartial games form an additive Abelian group. For impartial games in ...

Three impossible ways to combine four bars.

An impossible figure that locally (but only locally!) looks like a torus.