Search Results for ""

A unimodal sequence is a finite sequence that first increases and then decreases. A sequence {s_1,s_2,...,s_n} is unimodal if there exists a t such that s_1<=s_2<=...<=s_t ...

The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.

A constant sometimes called Varga's constant is defined by V=1/Lambda=9.2890254919... (OEIS A073007), where Lambda is the one-ninth constant.

In general, there is no unique matrix solution A to the matrix equation y=Ax. Even in the case of y parallel to x, there are still multiple matrices that perform this ...

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