Search Results for ""

A conjecture which treats the heights of points relative to a canonical class of a curve defined over the integers.

A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...

Constants gamma such that [int_Omega|f|^qdx]^(1/q)<=gamma[int_Omegasum_(i=1)^N|(partialf)/(partialx_i)|^pdx]^(1/p), where f is a real-valued smooth function on a region Omega ...

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...

The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

Any tangle obtained by additions and multiplications of rational tangles (Adams 1994).

One of the Zermelo-Fraenkel axioms which asserts the existence for any set a of a set x such that, for any y of a, if there exists a z satisfying A(y,z), then such z exists ...