Search Results for ""

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Delta(n) of the smallest of the ...

The curve produced by fixed point P on the circumference of a small circle of radius b rolling around the inside of a large circle of radius a>b. A hypocycloid is therefore a ...

To predict the result of a measurement requires (1) a model of the system under investigation, and (2) a physical theory linking the parameters of the model to the parameters ...

The Jack polynomials are a family of multivariate orthogonal polynomials dependent on a positive parameter alpha. Orthogonality of the Jack polynomials is proved in Macdonald ...

The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...

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

Let ||f|| be the supremum of |f(x)|, a real-valued function f defined on (0,infty). If f is twice differentiable and both f and f^('') are bounded, Landau (1913) showed that ...

The term limit comes about relative to a number of topics from several different branches of mathematics. A sequence x_1,x_2,... of elements in a topological space X is said ...