Search Results for ""

One of the Eilenberg-Steenrod axioms which states that, if f:(X,A)->(Y,B) is homotopic to g:(X,A)->(Y,B), then their induced maps f_*:H_n(X,A)->H_n(Y,B) and ...

The 6-polyiamonds illustrated above.

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 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 ...

The subset consisting of all elements of a given set is called an improper subset (Kamke 1950, p. 6).