TOPICS
Search

Search Results for ""


381 - 390 of 1128 for Inline 20Search Results
If {f_n} is a sequence of nonnegative measurable functions, then intlim inf_(n->infty)f_ndmu<=lim inf_(n->infty)intf_ndmu. (1) An example of a sequence of functions for which ...
An object created by folding a piece of paper along certain lines to form loops. The number of states possible in an n-flexagon is a Catalan number. By manipulating the ...
Gabriel's horn, also called Torricelli's trumpet, is the surface of revolution of the function y=1/x about the x-axis for x>=1. It is therefore given by parametric equations ...
The Gall orthographic projection is a cylindrical equal-area projection with standard parallel of 45 degrees.
A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...
The locus of a point P (or the envelope of a line) fixed in relation to a curve C which slides between fixed curves. For example, if C is a line segment and P a point on the ...
A golden rhombus is a rhombus whose diagonals are in the ratio p/q=phi, where phi is the golden ratio. The faces of the acute golden rhombohedron, Bilinski dodecahedron, ...
For the hyperbolic partial differential equation u_(xy) = F(x,y,u,p,q) (1) p = u_x (2) q = u_y (3) on a domain Omega, Goursat's problem asks to find a solution u(x,y) of (3) ...
An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...
The Harary graph H_(k,n) is a particular example of a k-connected graph with n graph vertices having the smallest possible number of edges. The smallest number of edges ...
1 ... 36|37|38|39|40|41|42 ... 113 Previous Next

...