Search Results for ""

A translation without rotation or distortion.

There are certain optimization problems that become unmanageable using combinatorial methods as the number of objects becomes large. A typical example is the traveling ...

The Sobolev embedding theorem is a result in functional analysis which proves that certain Sobolev spaces W^(k,p)(Omega) can be embedded in various spaces including ...

The series of Sturm functions arising in application of the Sturm theorem.

One of the 14 4-polyaboloes.

There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...

A polynomial in a single variable, e.g., P(x)=a_2x^2+a_1x+a_0, as opposed to a multivariate polynomial.

There are a great many beautiful identities involving q-series, some of which follow directly by taking the q-analog of standard combinatorial identities, e.g., the ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...