Search Results for ""

There is a one-to-one correspondence between the sets of equivalent correspondences (not of value 0) on an irreducible curve of curve genus p, and the rational collineations ...

Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...

A specification of elements in a list as a list of pairs giving the element and number of times it occurs in a run. For example, given the list ...

In n dimensions for n>=5 the arrangement of hyperspheres whose convex hull has minimal content is always a "sausage" (a set of hyperspheres arranged with centers along a ...

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

Let f(1)=1, and let f(n) be the number of occurrences of n in a nondecreasing sequence of integers. then the first few values of f(n) are 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, ... ...

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