TOPICS
Search

Search Results for ""


12611 - 12620 of 13135 for www.bong88.com login %...Search Results
The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...
A polygon whose interior consists of all points in the plane which are closer to a particular lattice point than to any other. The generalization to n dimensions is called a ...
The Voronov-Neopryatnaya-Dergachev graphs are two graphs on 372 and 972 vertices which have unit-distance embeddings with all vertices on a sphere and chromatic number 5. The ...
The voter model is a simple mathematical model of opinion formation in which voters are located at the nodes of a network, each voter has an opinion (in the simplest case, 0 ...
The simple process of voting leads to surprisingly counterintuitive paradoxes. For example, if three people vote for three candidates, giving the rankings A, B, C; B, C, A; ...
A W^*-algebra is a C-*-algebra A for which there is a Banach space A_* such that its dual is A. Then the space A_* is uniquely defined and is called the pre-dual of A. Every ...
The W-transform of a function f(x) is defined by the integral where Gamma[(beta_m)+s, 1-(alpha_n)-s; (alpha_p^(n+1))+s, 1-(beta_q^(m+1))-s] =Gamma[beta_1+s, ..., beta_m+s, ...
A basin of attraction in which every point on the common boundary of that basin and another basin is also a boundary of a third basin. In other words, no matter how closely a ...
The partial differential equation iu_t+[(1+|u|^2u)^(-1/2)u]_(xx)=0.
The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...

...