Search Results for ""
761 - 770 of 1833 for Disk covering problemSearch Results
According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...
First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...
The Freemish crate, also called Escher's cube (Elber) or Hyzer's illusion (Pappas 1989, p. 13), is an impossible figure box that can be drawn but not built. It appears in ...
A minimal surface and double algebraic surface of 15th order and fifth class which can be given by parametric equations x(u,v) = 2sinhucosv-2/3sinh(3u)cos(3v) (1) y(u,v) = ...
A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...
In spherical coordinates, the scale factors are h_r=1, h_theta=rsinphi, h_phi=r, and the separation functions are f_1(r)=r^2, f_2(theta)=1, f_3(phi)=sinphi, giving a Stäckel ...
Intuitively, a d-dimensional discrete percolation model is said to be long-range if direct flow is possible between pairs of graph vertices or graph edges which are "very ...
Let E be a compact connected subset of d-dimensional Euclidean space. Gross (1964) and Stadje (1981) proved that there is a unique real number a(E) such that for all x_1, ...
A 2-dimensional discrete percolation model is said to be mixed if both graph vertices and graph edges may be "blocked" from allowing fluid flow (i.e., closed in the sense of ...
O_h is the point group of symmetries of the octahedron having order 48 that includes inversion. It is also the symmetry group of the cube, cuboctahedron, and truncated ...
...
View search results from all Wolfram sites (161691 matches)

