Search Results for ""

A type of compact surface studied by German mathematician Otto Zoll following an idea of Darboux. It is characterized by the property that all its geodesics are closed and of ...

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

Mastermind is a simple two-player code-breaking board game invented in 1970 by Mordecai Meirowitz, an Israeli postmaster and telecommunications expert. It may have been ...

The Barnes-Wall lattice is a d-dimensional lattice that exists when d is a power of 2. It is implemented in the Wolfram Language as LatticeData[{"BarnesWall", n}]. Special ...

A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

The Carlson elliptic integrals, also known as the Carlson symmetric forms, are a standard set of canonical elliptic integrals which provide a convenient alternative to ...

The contact triangle of a triangle DeltaABC, also called the intouch triangle, is the triangle DeltaC_AC_BC_C formed by the points of tangency of the incircle of DeltaABC ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...