TOPICS
Search

Search Results for ""


3101 - 3110 of 5395 for Exotic R 4Search Results
The Gergonne point Ge is the perspector of a triangle DeltaABC and its contact triangle DeltaT_AT_BT_C. It has equivalent triangle center functions alpha = [a(b+c-a)]^(-1) ...
A plane path on a set of equally spaced lattice points, starting at the origin, where the first step is one unit to the north or south, the second step is two units to the ...
A googol is a large number equal to 10^(10^2)=10^(100) (i.e., a 1 with 100 zeros following it). Written out explicitly, ...
Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...
Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...
An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...
Green's theorem is a vector identity which is equivalent to the curl theorem in the plane. Over a region D in the plane with boundary partialD, Green's theorem states ...
The Hartley Transform is an integral transform which shares some features with the Fourier transform, but which, in the most common convention, multiplies the integral kernel ...
A heart-shaped surface given by the sextic equation (x^2+9/4y^2+z^2-1)^3-x^2z^3-9/(80)y^2z^3=0 (Taubin 1993, 1994). The figures above show a ray-traced rendering (left) and ...
A connected graph is said to be highly irregular if the neighbors of each vertex have distinct vertex degrees. Highly irregular graphs exist on all orders except 3, 5 and 7, ...
1 ... 308|309|310|311|312|313|314 ... 540 Previous Next

...