Search results
Results From The WOW.Com Content Network
Unit disks are special cases of disks and unit balls; as such, they contain the interior of the unit circle and, in the case of the closed unit disk, the unit circle itself. Without further specifications, the term unit disk is used for the open unit disk about the origin , D 1 ( 0 ) {\displaystyle D_{1}(0)} , with respect to the standard ...
Every induced subgraph of a unit disk graph is also a unit disk graph. An example of a graph that is not a unit disk graph is the star K 1 , 6 {\displaystyle K_{1,6}} with one central node connected to six leaves: if each of six unit disks touches a common unit disk, some two of the six disks must touch each other.
In mathematics, and specifically in potential theory, the Poisson kernel is an integral kernel, used for solving the two-dimensional Laplace equation, given Dirichlet boundary conditions on the unit disk. The kernel can be understood as the derivative of the Green's function for the Laplace equation. It is named for Siméon Poisson.
The disks are laid such that their centers form a polygonal path from the value where () is maximized to any other point in the domain, while being totally contained within the domain. Thus the existence of a maximum value implies that all the values in the domain are the same, thus f ( z ) {\displaystyle f(z)} is constant.
The function F defined on the unit disk by F(re iθ) = (f ∗ P r)(e iθ) is harmonic, and M f is the radial maximal function of F. When M f belongs to L p ( T ) and p ≥ 1, the distribution f " is " a function in L p ( T ), namely the boundary value of F .
This page was last edited on 17 May 2006, at 13:54 (UTC).; Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply ...
In geometry, a disk (also spelled disc) [1] is the region in a plane bounded by a circle. A disk is said to be closed if it contains the circle that constitutes its boundary, and open if it does not. [2] For a radius, , an open disk is usually denoted as and a closed disk is ¯.
The disk covering problem asks for the smallest real number such that disks of radius () can be arranged in such a way as to cover the unit disk. Dually, for a given radius ε , one wishes to find the smallest integer n such that n disks of radius ε can cover the unit disk.