TOPICS
Search

Search Results for ""


8481 - 8490 of 13135 for Discrete Fourier TransformSearch Results
A functor is said to be faithful if it is injective on maps. This does not necessarily imply injectivity on objects. For example, the forgetful functor from the category of ...
A module M over a unit ring R is called faithful if for all distinct elements a, b of R, there exists x in M such that ax!=bx. In other words, the multiplications by a and by ...
A module M over a unit ring R is called faithfully flat if the tensor product functor - tensor _RM is exact and faithful. A faithfully flat module is always flat and ...
A fallacy is an incorrect result arrived at by apparently correct, though actually specious reasoning. The great Greek geometer Euclid wrote an entire book on geometric ...
Euler (1738, 1753) considered the series s_a(x)=sum_(n=1)^infty[1/(1-a^n)product_(k=0)^(n-1)(1-xa^(-k))]. He showed that just like log_a(a^n)=n, s_a(a^n)=n for nonnegative ...
The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...
The far-out point F of a triangle DeltaABC is the inverse point of the triangle centroid with respect to the circumcircle of DeltaABC. For a triangle with side lengths a, b, ...
A Julia set J consisting of a set of isolated points which is formed by taking a point outside an underlying set M (e.g., the Mandelbrot set). If the point is outside but ...
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 ...
Let T_n(x) be an arbitrary trigonometric polynomial T_n(x)=1/2a_0+{sum_(k=1)^n[a_kcos(kx)+b_ksin(kx)]} (1) with real coefficients, let f be a function that is integrable over ...
1 ... 846|847|848|849|850|851|852 ... 1314 Previous Next

...