Search Results for ""

Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...

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

1. Find a complete system of invariants, or 2. Decide when two metrics differ only by a coordinate transformation. The most common statement of the problem is, "Given metrics ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

Let A={a_1,a_2,...} be a free Abelian semigroup, where a_1 is the identity element, and let mu(n) be the Möbius function. Define mu(a_n) on the elements of the semigroup ...

A natural equation is an equation which specifies a curve independent of any choice of coordinates or parameterization. The study of natural equations began with the ...

An outlier is an observation that lies outside the overall pattern of a distribution (Moore and McCabe 1999). Usually, the presence of an outlier indicates some sort of ...

The problem in calculus of variations to find the minimal surface of a boundary with specified constraints (usually having no singularities on the surface). In general, there ...

There are a number of functions in various branches of mathematics known as Riemann functions. Examples include the Riemann P-series, Riemann-Siegel functions, Riemann theta ...