Search Results for ""

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

For K a given knot in S^3, choose a Seifert surface M^2 in S^3 for K and a bicollar M^^×[-1,1] in S^3-K. If x in H_1(M^^) is represented by a 1-cycle in M^^, let x^+ denote ...

Let X be a set and S a collection of subsets of X. A subset A subset X is shattered by S if each subset B subset A of A can be expressed as the intersection of A with a ...

In floating-point arithmetic, the significand is a component of a finite floating-point number containing its significant digits. Generally speaking, the significand can be ...

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

In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...

For a braid with M strands, R components, P positive crossings, and N negative crossings, {P-N<=U_++M-R if P>=N; P-N<=U_-+M-R if P<=N, (1) where U_+/- are the smallest number ...

The small rhombicosidodecahedral graph is a quartic graph on 60 nodes and 120 edges that corresponds to the skeleton of the small rhombicosidodecahedron, as well as the great ...

The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, ...

A smooth function is a function that has continuous derivatives up to some desired order over some domain. A function can therefore be said to be smooth over a restricted ...