Search Results for ""

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

Set theory is the mathematical theory of sets. Set theory is closely associated with the branch of mathematics known as logic. There are a number of different versions of set ...

A problem also known as the points problem or unfinished game. Consider a tournament involving k players playing the same game repetitively. Each game has a single winner, ...

The silver constant is the algebraic number given by S = (x^3-5x^2+6x-1)_3 (1) = 2+2cos(2/7pi) (2) = 3.246979603... (3) (OEIS A116425), where (P(x))_n denotes a polynomial ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

A simple polyhedron, also called a simplicial polyhedron, is a polyhedron that is topologically equivalent to a sphere (i.e., if it were inflated, it would produce a sphere) ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

Given a simplex of unit content in Euclidean d-space, pick n>=d+1 points uniformly and independently at random, and denote the expected content of their convex hull by ...

A knot K in S^3=partialD^4 is a slice knot if it bounds a disk Delta^2 in D^4 which has a tubular neighborhood Delta^2×D^2 whose intersection with S^3 is a tubular ...