Search Results for ""

For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...

Togliatti (1940, 1949) showed that quintic surfaces having 31 ordinary double points exist, although he did not explicitly derive equations for such surfaces. Beauville ...

The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...

A "pointwise-bounded" family of continuous linear operators from a Banach space to a normed space is "uniformly bounded." Symbolically, if sup||T_i(x)|| is finite for each x ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...

Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...

Linnik's constant L is the constant appearing in Linnik's theorem. Heath-Brown (1992) has shown that L<=5.5, and Schinzel, Sierpiński, and Kanold (Ribenboim 1989) have ...

In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...