Search Results for ""

Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...

Let Y_n denote the graph with vertex set V(X_n), where X_n is the n-hypercube and two vertices are adjacent in Y_n iff they are at distance 1<=d<=2 in X_n. Y_n is not ...

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

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 word net has several meanings in mathematics. It refers to a plane diagram in which the polyhedron edges of a polyhedron are shown, a point set satisfying certain ...

An out-shuffle, also known as a perfect shuffle (Golomb 1961), is a riffle shuffle in which the top half of the deck is placed in the right hand, and cards are then ...

An analog of the polyominoes and polyiamonds in which collections of regular hexagons are arranged with adjacent sides. They are also called hexes, hexas, or polyfrobs ...

There are two kinds of power sums commonly considered. The first is the sum of pth powers of a set of n variables x_k, S_p(x_1,...,x_n)=sum_(k=1)^nx_k^p, (1) and the second ...

A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...