Search Results for ""
801 - 810 of 1833 for Disk covering problemSearch Results
A list of problems in low-dimensional topology maintained by Kirby (1995). The list currently runs about 380 pages.
A magic hexagon of order n is an arrangement of close-packed hexagons containing the numbers 1, 2, ..., H_(n-1), where H_n is the nth hex number such that the numbers along ...
A partial differential equation of second-order, i.e., one of the form Au_(xx)+2Bu_(xy)+Cu_(yy)+Du_x+Eu_y+F=0, (1) is called parabolic if the matrix Z=[A B; B C] (2) ...
A knot having the property that no surgery could possibly yield a counterexample to the Poincaré conjecture is said to satisfy Property P (Adams 1994, p. 262).
A square grid is a grid formed by tiling the plane regularly with squares.
A vertex is a special point of a mathematical object, and is usually a location where two or more lines or edges meet. Vertices are most commonly encountered in angles, ...
A triangle in which all three angles are acute angles. A triangle which is neither acute nor a right triangle (i.e., it has an obtuse angle) is called an obtuse triangle. ...
There are three types of boundary conditions commonly encountered in the solution of partial differential equations: 1. Dirichlet boundary conditions specify the value of the ...
According to Pólya, the Cartesian pattern is the resolution method for arithmetical or geometrical problems based on equations. The first step is to translate the question ...
If V and W are Banach spaces and T:V->W is a bounded linear operator, the T is said to be a compact operator if it maps the unit ball of V into a relatively compact subset of ...
...
View search results from all Wolfram sites (161691 matches)

